1.Codeforces Round 879 (Div. 2)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
void func()
{
int n;
cin >> n;
vector<int>a(n);
int fu = 0;
int zh = 0;
int ans = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (a[i] < 0)fu++;
else zh++;
}
if (fu > zh)//-1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1
{
ans = fu - n / 2;//fu一定大于n/2
fu = n / 2;//操作后fu一定要是偶数
}
//如果zh>=fu,ans=0
if (fu % 2 == 0)
{
cout << ans << endl;
}
else
{
cout << ans + 1 << endl;
}
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
2.Educational Codeforces Round 150 (Rated for Div. 2)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
void func()
{
int n;
cin >> n;
if (n <= 4)
cout << "Bob" << endl;
else
cout << "Alice" << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
3. Codeforces Global Round 23, problem: (B)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
//a只有0和1
//进行可以将ai加到aj上后把ai删掉(i<j)
//0放到前面1放到后面就可以了,如果a中前面(0的数目)是1不是0的话就进行操作
void func()
{
int n;
int ans = 0, count0 = 0, count1 = 0;
cin >> n;
vector<int>a;
for (int j = 0; j < n; j++)
{
int x;
cin >> x;
a.push_back(x);
if (x == 0)count0++;
else count1++;
}
for (int i = 0; i < count0; i++)
{
if (a[i] != 0)
ans++;
}
cout << ans << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
4.Codeforces Round 878 (Div. 3)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
void func()
{
int n;
cin >> n;
string s;
cin >> s;
string ans;
for (int i = 0; i+1 < n; i++)
{
char x = s[i];//第一个a
ans = ans + x;
while (x != s[i + 1])//不相等则继续找到下一个a
{
i++;
}
i++;
}
cout << ans << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
5.Codeforces Round 877 (Div. 2)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
void func()
{
int n;
cin >> n;
vector<int>a(n);
for (auto& x : a)cin >> x;
sort(all(a));
if (a[0] < 0)
cout << a[0] << endl;
else
cout << a[n - 1] << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
6.Codeforces Round 876 (Div. 2)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
void func()
{
int n, k;
cin >> n >> k;
if (k == 1)
{
cout << n << endl;
return;
}
int ans = 0;
if (n % k == 0||n % k == 1)
ans = n / k + 1;
else
ans = n / k + 2;
cout << ans << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
7.Codeforces Round 875 (Div. 1)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
vector<pii>adj[N];
int ans;
void dfs(int node, int par, int pos, int cnt)
{
for (auto ed : adj[node])
{
if (ed.first != par)dfs(ed.first, node, ed.second, cnt + (ed.second < pos));
}
ans = max(ans, cnt);
}
void func()
{
int n;
cin >> n;
ans = 0;
for (int i = 0; i <= n; i++)adj[i].clear();
for (int i = 1; i < n; i++)
{
int x, y;
cin >> x >> y;
adj[x].push_back({ y,i });
adj[y].push_back({ x,i });
}
dfs(1, -1, 0, 1);
cout << ans << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
8.Codeforces Round 828 (Div. 3)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
void func()
{
int n;
string s;
cin >> n;
vector<int>a(n);
for (auto& x : a)cin >> x;
cin >> s;
map<int, char>m;
bool ok = 1;
for (int i = 0; i < n; i++)
{
if (m[a[i]]==0)
{
m[a[i]] = s[i];
}
else
{
if (m[a[i]]==s[i])
continue;
else
{
ok = 0;
break;
}
}
}
if (!ok)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
9.Codeforces Round 828 (Div. 3)(B)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
void func()
{
int n, q;
cin >> n >> q;
vector<int>a(n);
ll sum = 0;
int d1 = 0;
int d2 = 0;
for (auto& x : a)
{
cin >> x;
sum += x;
if (x % 2 == 0)
d2++;
else
d1++;
}
vector<pii>que(q);
for (auto& x : que)
{
cin >> x.first >> x.second;
if (x.first == 0)
{
sum += d2 * x.second;
//偶数+奇数=奇数;偶数+偶数=偶数
if (x.second % 2 != 0)
{
d1 += d2;
d2 = 0;
}
}
else
{
sum += d1 * x.second;
//奇数+奇数=偶数;奇数+偶数=奇数
if (x.second % 2 != 0)
{
d2 += d1;
d1 = 0;
}
}
cout << sum << endl;
}
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
10.Educational Codeforces Round 137 (Rated for Div. 2)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
void func()
{
int n;
cin >> n;
vector<int>a(n);//升序
int vis[10] = { 0 };
int ans = 0;
for (auto& x : a)
{
cin >> x;
vis[x] = 1;
}
for (int i = 0; i < 10; i++)
{
if (vis[i] == 0)
{
ans++;
}
}
cout << (ll)6*ans * (ans - 1) / 2 << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
11.Educational Codeforces Round 137 (Rated for Div. 2)(B)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
void func()
{
int n;
cin >> n;
cout << 1 << " ";
for (int i = n; i >= 2; i--)
{
cout << i << " ";
}
cout << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
12.Educational Codeforces Round 138 (Rated for Div. 2)(A)
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
void func()
{
int n, m;
cin >> n >> m;
//n*n的棋盘
//m个棋子,一开始是合法状态
//只能上下左右移动
vector<pii>k;
for (int i = 0; i < m; i++)
{
int x, y;
cin >> x >> y;
k.push_back({ x,y });
}
if (m < n)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}