自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(9)
  • 收藏
  • 关注

原创 Codeforces Round #690 (Div. 3) A-E2

A. Favorite Sequence水题,只要按题目要求输出即可。#include<bits/stdc++.h>using namespace std;#define MULTICASE int _;cin >> _;while(_ --)#define IO ios::sync_with_stdio(false);\ cin.tie(NULL);\ cout.tie(NULL);const int N = 400;

2020-12-16 12:35:55 218

原创 [COCI2010-2011#6] STEP

题目链接题解这题可以通过线段树的方法较为轻松的解决,而我的这个方法更为暴力。我们可以考虑维护以下两个操作:merge(x,y)merge(x, y)merge(x,y)令这两个位置的集合进行暴力合并– split(x)split(x)split(x)使得位置xxx的数从集合中脱离出来– 用multisetmultisetmultiset维护每个区间的长度,用set<pair>set<pair>set<pair>来维护每个区间的左右区间对于merge(x,y

2021-08-26 20:48:25 186

原创 Educational Codeforces Round 112 (Rated for Div. 2) A-D

A.PizzaForcesA. PizzaForcesA.PizzaForces水题,分奇偶两种情况讨论,如果是偶数的话直接/2*5,如果是奇数的话就+1再/2*5。#include<bits/stdc++.h>#include<ext/rope> using namespace std;using namespace __gnu_cxx;#define int long long#define IO ios::sync_with_stdio(false);\

2021-07-31 15:45:37 99

原创 Codeforces Round #689 (Div. 2, based on Zed Code Competition) A-C

A. String Generation水题,先输出m个a后在由c’b,a的顺序倒序输出即可。#include<bits/stdc++.h>using namespace std;#define IO() ios::sync_with_stdio(false);\ cin.tie(NULL);\ cout.tie(NULL);#define MULTICASE int _;cin >> _;while(_ --)main

2020-12-12 11:24:05 223

原创 Codeforces Round #687 (Div. 2, based on Technocup 2021 Elimination Round 2)

A. Prison Break水题,枚举四个到左上,左下,右上,右下四个点的最短距离即可题目地址#include<bits/stdc++.h>using namespace std;typedef long long ll;int main(){ ll n, m, r, c; int _; cin >> _; while(_ --) { cin >> n >> m >> r

2020-12-06 18:43:34 98

原创 Qualification Round 2020 - Code Jam 2020

VestigiumProblemVestigium means “trace” in Latin. In this problem we work with Latin squares and matrix traces.The trace of a square matrix is the sum of the values on the main diagonal (which runs...

2020-04-10 22:38:57 392

原创 Educational Codeforces Round 83 (Rated for Div. 2) A - C

A.Two Regular Polygons题意:在一个凸的正多边形中,选择任意多顶点,能否再构造一个凸正多边形。思路:水题,只要构造出来的正多边形的边数是原正多边形边数的因数即可。Code:#include<bits/stdc++.h>using namespace std;int main(int argc,char *argv[]){ int t; i...

2020-03-10 11:10:19 1627

原创 Educational Codeforces Round 80 (Rated for Div. 2) A. Deadline

time limit per test : 2 secondsmemory limit per test : 256 megabytesinput : standard input output : standard outputDescriptionAdilbek was assigned to a special project. For Adilbek it means that ...

2020-01-29 22:03:30 131

原创 Codeforces - 1097B Petr and a Combination Lock

CodeBlocks - 1097B Petr and a Combination Lock原题地址DescriptionPetr has just bought a new car. He’s just arrived at the most known Petersburg’s petrol station to refuel it when he suddenly discovered...

2020-01-11 19:58:57 311

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除