CF1178团队刷题目日记

A	Prime Minister

Problem - A - Codeforces

1. #include<vector>
2. #include<iostream>
3. using namespace std;
4. int main(){
5. int n;
6. cin>>n;
7. vector<int>a(n);
8. vector<int>b(n,0);
9. int sum=0;
10. int sum1=0;
11. int cnt=1;
12. for(int i=0;i<n;i++)
13. {
14. cin >> a[i];
15. sum+=a[i];
16. if(a[i]<a[0]/2+1)
17. {
18. b[i]=1;
19. cnt++;
20. sum1+=a[i];
21. }
22. }
23. b[0]=1;
24. sum1+=a[0];
25. if(2*sum1<=sum)
26. cout<<"0"<<endl;
27. else
28. {
29. cout<<cnt<<endl;
30. for(int i=0;i<n;i++)
31. {
32. if(b[i]==1)
33. cout<<i+1<<" ";
34. }
35. }
36. return 0;
37. }

B	WOW Factor

Problem - B - Codeforces

1. #include <iostream>
2. #include <string>
3. #include <vector>
5. using namespace std;
6. using LL = long long;
8. int main()
9. {
10. LL result = 0;
11. string s;
12. cin >> s;
13. vector<LL> prefix_vn(s.length());
14. vector<LL> suffix_vn(s.length());
15. for (LL i = 0; i < s.length() - 1; ++i)
16. {
17. if (s[i] == 'v' && i > 0 && s[i - 1] == 'v')
18. prefix_vn[i + 1] = 1;
19. prefix_vn[i + 1] += prefix_vn[i];
20. }
21. for (LL i = 0; i < s.length() - 1; ++i)
22. {
23. if (s[s.length() - i - 1] == 'v' && i > 0 && s[s.length() - i] == 'v')
24. suffix_vn[s.length() - i - 2] = 1;
25. suffix_vn[s.length() - i - 2] += suffix_vn[s.length() - i - 1];
26. }
27. for (LL i = 0; i < s.length(); ++i)
28. if (s[i] == 'o')
29. result += prefix_vn[i] * suffix_vn[i];
30. cout << result << '\n';
31. return 0;
32. }

C

Tiles

Problem - C - Codeforces

1. #include <iostream>
3. using namespace std;
4. using LL = long long;
6. const LL MODULO = 998'244'353;
8. LL fast_pow(LL base, LL exp)
9. {
10. LL result = 0, mult = 0;
11. result = 1;
12. mult = base;
13. while (exp > 0)
14. {
15. if (exp % 2 == 1)
16. result = result * mult % MODULO;
17. mult = mult * mult % MODULO;
18. exp /= 2;
19. }
20. return result;
21. }
23. int main()
24. {
25. LL width = 0, height = 0;
26. cin >> width >> height;
27. cout << fast_pow(2, width + height) << '\n';
28. return 0;
29. }

D	Prime Graph

Problem - D - Codeforces

1. #include <iostream>
2. #include <vector>
4. using namespace std;
6. bool is_prime(int n)
7. {
8. if (n <= 1)
9. return false;
10. for (int f = 2; f * f <= n; ++f)
11. if (n % f == 0)
12. return false;
13. return true;
14. }
16. const int N = 1'000;
18. int degrees[N];
20. int main()
21. {
22. int n = 0, extra = 0;
23. cin >> n;
24. vector<pair<int, int>> edges;
25. for (int i = 0; i < n; ++i)
26. edges.push_back({i, (i + 1) % n});
27. while (!is_prime(n + extra))
28. ++extra;
29. for (int i = 0; i < extra; ++i)
30. edges.push_back({i, (i + n / 2) % n});
31. cout << n + extra << '\n';
32. for (int i = 0; i < n + extra; ++i)
33. cout << edges[i].first + 1 << ' ' << edges[i].second + 1 << '\n';
34. return 0;
35. }

E	Archaeology

Problem - E - Codeforces

1. #include <bits/stdc++.h>
3. using namespace std;
5. string s;
6. char cur;
7. int l,r;
9. void solve()
10. {
11. cin>>s;
13. deque<int>a,b,c;
15. for(int i=0;i<s.size();i++)
16. {
17. if(s[i]=='a')a.push_back(i);
18. else if(s[i]=='b')b.push_back(i);
19. else c.push_back(i);
21. if(s.size()%2==1&&i==s.size()/2)cur=s[i];
22. }
24. string ans="";
26. if(a.size()>=s.size()/2)
27. {
28. for(int i=1;i<=s.size()/2;i++)cout<<'a';
30. puts("");
32. return;
33. }
35. if(b.size()>=s.size()/2)
36. {
37. for(int i=1;i<=s.size()/2;i++)cout<<'b';
39. puts("");
41. return;
42. }
44. if(c.size()>=s.size()/2)
45. {
46. for(int i=1;i<=s.size()/2;i++)cout<<'c';
48. puts("");
50. return;
51. }
53. int maxx;
55. while(1)
56. {
57. maxx=max(max(a.back()-a.front(),b.back()-b.front()),c.back()-c.front());
59. if(maxx==a.back()-a.front())
60. {
61. l=a.front(),r=a.back();
63. ans+='a';
64. }
65. else if(maxx==b.back()-b.front())
66. {
67. l=b.front(),r=b.back();
69. ans+='b';
70. }
71. else
72. {
73. l=c.front(),r=c.back();
75. ans+='c';
76. }
78. while(!a.empty()&&a.front()<=l)a.pop_front();
80. while(!b.empty()&&b.front()<=l)b.pop_front();
82. while(!c.empty()&&c.front()<=l)c.pop_front();
84. while(!a.empty()&&a.back()>=r)a.pop_back();
86. while(!b.empty()&&b.back()>=r)b.pop_back();
88. while(!c.empty()&&c.back()>=r)c.pop_back();
90. if(a.size()<=1&&b.size()<=1&&c.size()<=1)break;
91. }
93. //reverse(ans.begin(),ans.end());
95. if(ans.size()*2+(a.size()>=1||b.size()>=1||c.size()>=1)<s.size()/2)
96. {
97. puts("IMPOSSIBLE");
99. return;
100. }
102. cout<<ans;
104. if(a.size()>=1)cout<<'a';
105. else if(b.size()>=1)cout<<'b';
106. else if(c.size()>=1)cout<<'c';
108. reverse(ans.begin(),ans.end());
110. cout<<ans;
112. puts("");
113. }
115. int main()
116. {
117. int t=1;
119. //cin>>t;
121. while(t--)solve();
122. }