只有WA1不扣
by _sys @ 2019-09-15 20:38:25
只有WA1不扣
by Erusel @ 2019-09-15 20:41:32
只有WA1不扣
by Doveqise @ 2019-09-15 20:43:37
qwq好亏
死刚C题还没刚出来
一看D题博弈论秒了结果罚时罚一半+100分
by ZhuMingYang @ 2019-09-15 20:43:49
而且还是错这种
>expect"Monocarp" output"Monocrap"
我****
by ZhuMingYang @ 2019-09-15 20:45:58
@[ZhuMingYang](/space/show?uid=128523) 最后一秒调出E没交上去的我更惨
by zrz_orz @ 2019-09-15 20:46:03
@[zrz_orz](/space/show?uid=52295) ~~我上次最后一秒网卡了没交上去才惨~~
by ZhuMingYang @ 2019-09-15 20:48:26
有题解吗qaq
by AquaRio @ 2019-09-15 20:58:21
都别说了，家长强制不准打的我才最惨
by 引领天下 @ 2019-09-15 20:58:43
C题是不是和输出顺序有关啊
为什么我这个会挂？？
~~~c++
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<set>
#include<queue>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dwn(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,sum=0;
char s1[200010],s2[200010];
queue<char> veca,vecb;
vector<P> ans;
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=(x<<3)+(x<<1)+(ch^48);
ch=getchar();
}
return x*f;
}
int main()
{
n=read();
scanf("%s%s",s1+1,s2+1);
rep(i,1,n)
{
if(s1[i]=='a') sum++;
if(s2[i]=='a') sum++;
if(s1[i]=='a'&&s2[i]=='b') veca.push(i);
if(s1[i]=='b'&&s2[i]=='a') vecb.push(i);
}
if(sum%2!=0)
{
printf("-1\n");
return 0;
}
sum=0;
if(veca.size()%2==1)
{
ans.push_back(P(veca.front(),veca.front()));
ans.push_back(P(veca.front(),vecb.front()));
veca.pop();vecb.pop();
}
while(!veca.empty())
{
P t;
t.first=veca.front();veca.pop();
t.second=veca.front();veca.pop();
ans.push_back(t);
}
while(!vecb.empty())
{
P t;
t.first=vecb.front();vecb.pop();
t.second=vecb.front();vecb.pop();
ans.push_back(t);
}
printf("%d\n",int(ans.size()));
for(int i=0;i<ans.size();++i)
printf("%d %d\n",ans[i].first,ans[i].second);
return 0;
}
~~~
by ZhuMingYang @ 2019-09-15 21:04:32