| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 12797 | woqja125 | 전선 연결하기 (GA9_wire) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int d[600001];
int l[300001];
int ans[300001];
int a[300001], at=-1;
int b[300001], bt=-1;
int main()
{
int n, i;
int a, b, t;
a[++at] = b[++bt] = 10000000;
scanf("%d", &n);
for(i=1; i<=2*n; i++)
{
scanf("%d", d+i);
l[d[i]] = i;
}
for(i=1; i<=2*n; i++)
{
t = l[d[i]];
if(t == i) continue;
while(a[at] <= i) at--;
while(b[bt] <= i) bt--;
if(t > a && t > b)
{
// while(1);
printf("IMPOSSIBLE");
return 0;
}
if(t <= a[at] && (a[at] <= b[bt] || b[bt] < t) )
{
a[++at] = t;
ans[d[i]] = 0;
}
else if(t <= b[bt] && (b[bt] < a[at] || a[at] < t))
{
b[++bt] = t;
ans[d[i]] = 1;
}
else while(1);
}
for(i=1; i<=2*n; i++) printf("%c", ans[d[i]]==1?'v':'^');
return 0;
}