第十五周 6.6 --- 6.12

Posted 2020-07-23

6.6 --- 6.8

每天一门考试..

考得很萎靡...总之就是很颓...

所有的课都考完了...剩下的就是些课设和实验了..

end...

恩，接下来的时间就好好玩泥巴，该干嘛干嘛>.<

 

6.9

端午吃粽子 :D

cf 351 div2 d D - Bear and Two Paths

自己花式 构造了 一通然 wa

题解就是一幅图

没有想到这样在两边都搞成环/ TwT \\

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<vector>
 6 using namespace std;
 7 
 8 int n,k;
 9 int a,b,c,d;
10 
11 void solve(){
12     if(n == 4 || k < n+1){
13         puts("-1");
14         return;
15     }
16     vector<int> ans;
17     for(int i = 1;i <= n;i++){
18         if(i == a || i == b || i == c || i == d) continue;
19         ans.push_back(i);
20     }
21     printf("%d %d ",a,c);
22     for(int i = 0;i < ans.size();i++) printf("%d ",ans[i]);
23     printf("%d %d\\n",d,b);
24 
25     printf("%d %d ",c,a);
26     for(int i = 0;i < ans.size();i++) printf("%d ",ans[i]);
27     printf("%d %d\\n",b,d);
28 }
29 
30 int main(){
31     while(scanf("%d %d",&n,&k) != EOF){
32         scanf("%d %d %d %d",&a,&b,&c,&d);
33         solve();
34     }
35     return 0;
36 }

View Code