//alt: la dinamica de n^2 se observa ca pozitiile cu 1 sunt consecutive
#include<iostream>
#include<fstream>
#include<algorithm>
#include<stdlib.h>
using namespace std;
int A[2][1000005];
bool Mand[1000005];
int Rez[1000005];
int Chain[1000005];
void imposs()
{
cout<<"-1\n";
exit(0);
}
void markMandatory(int poz, int val)
{
if(Mand[poz]==1 && Rez[poz]!=val)
imposs();
else if(Mand[poz])
return;
while(poz>=1)
{
Mand[poz]=1;
Rez[poz]=val;
if(Mand[poz-1])
{
if(A[Rez[poz-1]][poz-1]>A[val][poz])
imposs();
break;
}
int nr=0;
int newval=-1;
if(A[0][poz-1]<=A[val][poz])
{
nr++;
newval=0;
}
if(A[1][poz-1]<=A[val][poz])
{
nr++;
newval=1;
}
if(nr==2)
break;
if(newval==-1)
imposs();
val=newval;
poz--;
}
}
int getval(int poz)
{
if(Mand[poz])
return A[Rez[poz]][poz];
return min(A[0][poz],A[1][poz]);
}
void flip(int st, int dr)
{
for(int i=st; i<=dr; i++)
Rez[i]=1-Rez[i];
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//ifstream fi("data.in");
int n;
cin>>n;
for(int i=1; i<=2*n; i++)
cin>>A[0][i];
for(int i=1; i<=2*n; i++)
cin>>A[1][i];
for(int i=1; i<=2*n; i++)
{
if(A[0][i]<=A[1][i])
{
if(getval(i-1)>A[0][i])
markMandatory(i,1);
if(i!=2*n && A[1][i]>max(A[0][i+1],A[1][i+1]))
markMandatory(i,0);
}
else
{
if(getval(i-1)>A[1][i])
markMandatory(i,0);
if(i!=2*n && A[0][i]>max(A[0][i+1],A[1][i+1]))
markMandatory(i,1);
}
}
int nra=0;
for(int i=1; i<=2*n; i++)
{
if(!Mand[i])
{
if(A[0][i]<=A[1][i])
Rez[i]=0;
else
Rez[i]=1;
}
nra+=(Rez[i]==0);
}
bool sw=0;
if(nra<n)
{
sw=1;
for(int i=1; i<=2*n; i++)
{
swap(A[0][i],A[1][i]);
Rez[i]=1-Rez[i];
}
nra=2*n-nra;
}
//convertesc unele A-uri in B, avand grija sa nu obtin conflicte
for(int i=1; i<=2*n; i++)
{
if(Mand[i])
continue;
if(!Mand[i-1] && A[1-Rez[i-1]][i-1]>A[Rez[i]][i]) //cand ii dau flip lui i-1 trb sa-i dau si lui i
Chain[i]=Chain[i-1];
else
Chain[i]=i;
}
int cnt=0;
int dr=2*n;
for(int i=2*n; i>=1; i--)
{
if(Mand[i])
continue;
if(Chain[i]!=Chain[i+1])
{
dr=i;
cnt=0;
}
if(Rez[i]==0)
cnt--;
else
cnt++;
if(cnt<0 && nra+cnt>=n)
{
nra+=cnt;
flip(i,dr);
dr=i-1;
cnt=0;
}
}
if(nra>n)
imposs();
for(int i=1; i<=2*n; i++)
{
if(A[Rez[i-1]][i-1]>A[Rez[i]][i])
imposs();
}
for(int i=1; i<=2*n; i++)
{
if(sw)
Rez[i]=1-Rez[i];
if(!Rez[i])
cout<<"A";
else
cout<<"B";
}
cout<<"\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
4 ms |
384 KB |
Output is correct |
| 4 |
Correct |
4 ms |
384 KB |
Output is correct |
| 5 |
Correct |
6 ms |
512 KB |
Output is correct |
| 6 |
Correct |
6 ms |
512 KB |
Output is correct |
| 7 |
Correct |
7 ms |
512 KB |
Output is correct |
| 8 |
Correct |
6 ms |
512 KB |
Output is correct |
| 9 |
Correct |
6 ms |
512 KB |
Output is correct |
| 10 |
Correct |
6 ms |
512 KB |
Output is correct |
| 11 |
Correct |
7 ms |
512 KB |
Output is correct |
| 12 |
Correct |
6 ms |
512 KB |
Output is correct |
| 13 |
Correct |
6 ms |
512 KB |
Output is correct |
| 14 |
Correct |
6 ms |
512 KB |
Output is correct |
| 15 |
Correct |
6 ms |
512 KB |
Output is correct |
| 16 |
Correct |
6 ms |
512 KB |
Output is correct |
| 17 |
Correct |
7 ms |
512 KB |
Output is correct |
| 18 |
Correct |
6 ms |
512 KB |
Output is correct |
| 19 |
Correct |
6 ms |
512 KB |
Output is correct |
| 20 |
Correct |
5 ms |
512 KB |
Output is correct |
| 21 |
Correct |
5 ms |
512 KB |
Output is correct |
| 22 |
Correct |
6 ms |
512 KB |
Output is correct |
| 23 |
Correct |
5 ms |
512 KB |
Output is correct |
| 24 |
Correct |
6 ms |
512 KB |
Output is correct |
| 25 |
Correct |
6 ms |
512 KB |
Output is correct |
| 26 |
Correct |
5 ms |
512 KB |
Output is correct |
| 27 |
Correct |
5 ms |
512 KB |
Output is correct |
| 28 |
Correct |
5 ms |
512 KB |
Output is correct |
| 29 |
Correct |
6 ms |
512 KB |
Output is correct |
| 30 |
Correct |
6 ms |
512 KB |
Output is correct |
| 31 |
Correct |
6 ms |
640 KB |
Output is correct |
| 32 |
Correct |
5 ms |
512 KB |
Output is correct |
| 33 |
Correct |
6 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct |
| 3 |
Correct |
4 ms |
384 KB |
Output is correct |
| 4 |
Correct |
4 ms |
384 KB |
Output is correct |
| 5 |
Correct |
6 ms |
512 KB |
Output is correct |
| 6 |
Correct |
6 ms |
512 KB |
Output is correct |
| 7 |
Correct |
7 ms |
512 KB |
Output is correct |
| 8 |
Correct |
6 ms |
512 KB |
Output is correct |
| 9 |
Correct |
6 ms |
512 KB |
Output is correct |
| 10 |
Correct |
6 ms |
512 KB |
Output is correct |
| 11 |
Correct |
7 ms |
512 KB |
Output is correct |
| 12 |
Correct |
6 ms |
512 KB |
Output is correct |
| 13 |
Correct |
6 ms |
512 KB |
Output is correct |
| 14 |
Correct |
6 ms |
512 KB |
Output is correct |
| 15 |
Correct |
6 ms |
512 KB |
Output is correct |
| 16 |
Correct |
6 ms |
512 KB |
Output is correct |
| 17 |
Correct |
7 ms |
512 KB |
Output is correct |
| 18 |
Correct |
6 ms |
512 KB |
Output is correct |
| 19 |
Correct |
6 ms |
512 KB |
Output is correct |
| 20 |
Correct |
5 ms |
512 KB |
Output is correct |
| 21 |
Correct |
5 ms |
512 KB |
Output is correct |
| 22 |
Correct |
6 ms |
512 KB |
Output is correct |
| 23 |
Correct |
5 ms |
512 KB |
Output is correct |
| 24 |
Correct |
6 ms |
512 KB |
Output is correct |
| 25 |
Correct |
6 ms |
512 KB |
Output is correct |
| 26 |
Correct |
5 ms |
512 KB |
Output is correct |
| 27 |
Correct |
5 ms |
512 KB |
Output is correct |
| 28 |
Correct |
5 ms |
512 KB |
Output is correct |
| 29 |
Correct |
6 ms |
512 KB |
Output is correct |
| 30 |
Correct |
6 ms |
512 KB |
Output is correct |
| 31 |
Correct |
6 ms |
640 KB |
Output is correct |
| 32 |
Correct |
5 ms |
512 KB |
Output is correct |
| 33 |
Correct |
6 ms |
512 KB |
Output is correct |
| 34 |
Correct |
301 ms |
27060 KB |
Output is correct |
| 35 |
Correct |
324 ms |
30968 KB |
Output is correct |
| 36 |
Correct |
323 ms |
30456 KB |
Output is correct |
| 37 |
Correct |
319 ms |
31096 KB |
Output is correct |
| 38 |
Correct |
336 ms |
34808 KB |
Output is correct |
| 39 |
Correct |
312 ms |
33912 KB |
Output is correct |
| 40 |
Correct |
342 ms |
36704 KB |
Output is correct |
| 41 |
Correct |
315 ms |
33788 KB |
Output is correct |
| 42 |
Correct |
337 ms |
32248 KB |
Output is correct |
| 43 |
Correct |
361 ms |
33404 KB |
Output is correct |
| 44 |
Correct |
357 ms |
33400 KB |
Output is correct |
| 45 |
Correct |
357 ms |
33400 KB |
Output is correct |
| 46 |
Correct |
352 ms |
36344 KB |
Output is correct |
| 47 |
Correct |
339 ms |
36472 KB |
Output is correct |
| 48 |
Correct |
339 ms |
36216 KB |
Output is correct |
| 49 |
Correct |
448 ms |
37240 KB |
Output is correct |
| 50 |
Correct |
353 ms |
32792 KB |
Output is correct |
| 51 |
Correct |
348 ms |
32652 KB |
Output is correct |
| 52 |
Correct |
235 ms |
24380 KB |
Output is correct |
| 53 |
Correct |
218 ms |
24184 KB |
Output is correct |
| 54 |
Correct |
206 ms |
25592 KB |
Output is correct |
| 55 |
Correct |
212 ms |
25336 KB |
Output is correct |
| 56 |
Correct |
337 ms |
36600 KB |
Output is correct |
| 57 |
Correct |
289 ms |
29944 KB |
Output is correct |
| 58 |
Correct |
316 ms |
30072 KB |
Output is correct |
| 59 |
Correct |
302 ms |
31480 KB |
Output is correct |
| 60 |
Correct |
281 ms |
29688 KB |
Output is correct |
| 61 |
Correct |
310 ms |
31348 KB |
Output is correct |
| 62 |
Correct |
292 ms |
31224 KB |
Output is correct |
| 63 |
Correct |
312 ms |
31660 KB |
Output is correct |
| 64 |
Correct |
289 ms |
30352 KB |
Output is correct |
| 65 |
Correct |
309 ms |
31604 KB |
Output is correct |
