
code force
文章平均质量分 80
超越大哥哥
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Codeforces Round #670 (Div. 2) C. Link Cut Centroids
只能说将近一年没打建图都不会建了.......就是只有偶数个,并且当前节点的所有子节点加自身正好是n/2时,才会出现这样的情况。思路一眼就出了,但是忘了需要按照无向图建图,我给默认有向建了个图....wa的自闭手速也明显不如以前了#include<iostream>#include<cstdio>#include<vector>using namespace std;vector<int>v[200000];int ins[2000原创 2020-09-13 09:29:20 · 231 阅读 · 0 评论 -
Divide by three, multiply by two
D. Divide by three, multiply by twotime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp likes to play with numbers. He takes some integer numbe...原创 2018-07-09 18:49:54 · 360 阅读 · 0 评论 -
Round560div3.E
E. Two Arrays and Sum of Functionstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two arrays aand b, both of len...原创 2019-05-15 10:56:12 · 182 阅读 · 0 评论