https://codeforces.com/contest/1546/problem/A
签到
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define ll long long
#define ull unsigned long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int maxn=105;
int t,n,num[maxn],numm[maxn],ans[maxn];
void solve()
{
cin>>n;
int sum=0,summ=0;
rep(i,1,n)cin>>num[i],sum+=num[i];
rep(i,1,n)cin>>numm[i],summ+=numm[i];
if(sum!=summ)
{
cout<<"-1"<<endl;
return;
}
rep(i,1,n)ans[i]=num[i]-numm[i];
int flag=1,cnt=0,top=0; pair<int,int>res[maxn];
//rep(i,1,n)cout<<ans[i]<<' ';cout<<endl;
while(flag)
{
flag=0;
for(int i=1;i<=n;i++)
{
if(ans[i]>0)
{
rep(j,1,n)
if(ans[j]<0)
{
res[++top].first=i,res[top].second=j;
ans[i]--;ans[j]++;
flag=1;cnt++;
break;
}
break;
}
}
}
cout<<cnt<<endl;
rep(i,1,top)cout<<res[i].first<<' '<<res[i].second<<endl;
}
int main()
{
ios
cin>>t;
while(t--)
{
solve();
}
return 0;
}
https://codeforces.com/contest/1546/problem/B
有n个字符串,对其打乱顺序,然后拿走一个,问拿走的是哪个字符串。
其他字符串都应该出现过两次,只出现过一次的字符串就是被拿走的字符串。可以用异或运算或者直接加减实现。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define ll long long
#define ull unsigned long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int maxn=1e5+5;
int t,n,m;
char str[maxn],ans[maxn];
void solve()
{
cin>>n>>m;
rep(i,0,m-1)ans[i]=0;
rep(i,1,n*2-1)
{
cin>>str;
rep(j,0,m-1)
{
ans[j]^=str[j];
}
}
rep(i,0,m-1)cout<<(char)ans[i];
cout<<endl;
//rep(i,0,m-1)cout<<(int)ans[i]<<' ';cout<<endl;
}
int main()
{
ios
cin>>t;
while(t--)solve();
return 0;
}
https://codeforces.com/contest/1546/problem/C
一群小朋友都朝向右边,可以交换两个小朋友,但被交换的这两个小朋友的朝向会左右改变,希望将小朋友衣服上的数字从小到大排序,但最后需要小朋友们都朝向右边,求是否能够做到。
可以推出只能交换隔一个位置的小朋友的位置。
那我们把奇数和偶数的小朋友拉出来排序,然后放回原来的数组,检验是否有序即可。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define ll long long
#define ull unsigned long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int maxn=1e5+5;
int t,n,num[maxn],even[maxn],odd[maxn],tope,topo,top;
void solve()
{
cin>>n;
tope=0,top=0,topo=0;
rep(i,1,n)
{
if(i%2)cin>>odd[++topo];
else cin>>even[++tope];
}
sort(even+1,even+1+tope);
sort(odd+1,odd+1+topo);
// rep(i,1,n)cout<<even[i]<<' ';cout<<endl;
// rep(i,1,n)cout<<odd[i]<<' ';cout<<endl;
tope=0;topo=0;
rep(i,1,n)
{
if(i%2)num[++top]=odd[++tope];
else num[++top]=even[++topo];
}
//rep(i,1,n)cout<<num[i]<<' ';cout<<endl;
rep(i,1,n-1)
{
if(num[i]>num[i+1])
{
cout<<"NO"<<endl;
return;
}
}
cout<<"YES"<<endl;
return;
}
int main()
{
ios
cin>>t;
while(t--)solve();
return 0;
}