codeforces#236_div2_C Searching for Graph
2014-03-17 03:00
387 查看
题目地址:cf#236_div2_C
题目意思:
给你n,p
要你构造一个有2n+p条边的图,使得,每一个含k个结点子图中,最多有2*k+p条边。
额,比赛的时候根据样例yy的
代码:
关于证明这个构造就能满足,想好了以后更新文章。
题目意思:
给你n,p
要你构造一个有2n+p条边的图,使得,每一个含k个结点子图中,最多有2*k+p条边。
额,比赛的时候根据样例yy的
代码:
#include<iostream> #include<vector> using namespace std; struct node { int a; int b; }; vector<node> v; int main() { int cas; cin>>cas; int n,p; while(cas--) { v.clear(); cin>>n>>p; for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) { node nod; nod.a=i; nod.b=j; v.push_back(nod); } for(int i=0;i<2*n+p;i++) { cout<<v[i].a+1<<' '<<v[i].b+1<<endl; } } }
关于证明这个构造就能满足,想好了以后更新文章。
相关文章推荐
- codeforces#236_div2_C Searching for Graph
- codeforces Searching for Graph
- Educational Codeforces Round 36 (Rated for Div. 2)D. Almost Acyclic Graph(正解!!百度的那些拓扑排序现在都已经TLE!)
- Educational Codeforces Round 35 (Rated for Div. 2) D. Inversion Counting
- 【Educational Codeforces Round 48 (Rated for Div. 2) D】Vasya And The Matrix
- 树形DP Codeforces Round #135 (Div. 2) D. Choosing Capital for Treeland
- Educational Codeforces Round 35 (Rated for Div. 2)
- Codeforces Round #464 (Div. 2) C.Convenient For Everybody
- Educational Codeforces Round 33 (Rated for Div. 2) A - Chess For Three
- 记一场(伪)CF (Educational Codeforces Round 40 (Rated for Div. 2) )
- Educational Codeforces Round 33 (Rated for Div. 2)A-F
- Codeforces Round #236 (Div. 2)__Searching for Graph
- Codeforces Round 40 (Rated for Div. 2) B 字符串 不互用字符字串问题
- Educational Codeforces Round 37 (Rated for Div. 2)【A B C】【水】【模拟】
- Educational Codeforces Round 37 (Rated for Div. 2)-F-SUM and REPLACE(线段树)
- Educational Codeforces Round 35 (Rated for Div. 2) A-D
- Educational Codeforces Round 35 (Rated for Div. 2) F. Tree Destruction(dfs)
- Educational Codeforces Round 39 (Rated for Div. 2) C. String Transformation
- Educational Codeforces Round 33 (Rated for Div. 2) B - Beautiful Divisors
- Educational Codeforces Round 33 (Rated for Div. 2) A-C题解