Soldier and Cards(Problem - 546C - Codeforces)

此题链接单击这里

#include <iostream>
#include <queue>
using namespace std;

int main()
{
int n;
cin>>n;
int a,b;
queue<int>qu_int_a;
cin>>a;
for(int i=0;i<a;i++)
{
int ai;
cin>>ai;
qu_int_a.push(ai);
}
cin>>b;
queue<int>qu_int_b;
for(int i=0;i<b;i++)
{
int bi;
cin>>bi;
qu_int_b.push(bi);
}
int num=0;
while(!qu_int_a.empty()&&!qu_int_b.empty()&&num<=(n*n)*2)
{
int ai,bi;
ai=qu_int_a.front();
bi=qu_int_b.front();
qu_int_a.pop();
qu_int_b.pop();
if(ai>bi)
{
qu_int_a.push(bi);
qu_int_a.push(ai);
}
else
{
qu_int_b.push(ai);
qu_int_b.push(bi);
}
num++;
}
if(qu_int_a.empty())
cout<<num<<' '<<2;
else if(qu_int_b.empty())
cout<<num<<' '<<1;
else
cout<<-1;

}

#include <iostream>
#include <queue>
using namespace std;
class  intqueue
{
int a[1000];
int t;
public :
intqueue()
{
t=-1;
}
void intpush(int i)
{
a[++t]=i;
}
void intpop()
{
for(int i=0;i<t;i++)
a[i]=a[i+1];
t--;
}
int intback()
{
return a[t];
}
bool intempty()
{
if(t==-1)
return true;
else
return false;
}
int intfront()
{
return a[0];
}
};
int main()
{
int n;
cin>>n;
int a,b;
intqueue qu_int_a;
cin>>a;
for(int i=0;i<a;i++)
{
int ai;
cin>>ai;
qu_int_a.intpush(ai);
}
cin>>b;
intqueue qu_int_b;
for(int i=0;i<b;i++)
{
int bi;
cin>>bi;
qu_int_b.intpush(bi);
}
int num=0;
while(!qu_int_a.intempty()&&!qu_int_b.intempty()&&num<=(n*n)*2)
{
int ai,bi;
ai=qu_int_a.intfront();
bi=qu_int_b.intfront();
qu_int_a.intpop();
qu_int_b.intpop();
if(ai>bi)
{
qu_int_a.intpush(bi);
qu_int_a.intpush(ai);
}
else
{
qu_int_b.intpush(ai);
qu_int_b.intpush(bi);
}
num++;
}
if(qu_int_a.intempty())
cout<<num<<' '<<2;
else if(qu_int_b.intempty())
cout<<num<<' '<<1;
else
cout<<-1;

}