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 main()
{
int n, i;
int a, b, t;
a = b = 1000000;
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++)
{
if(l[d[i]] == i) continue;
if(a <= i) a = 1000000;
if(b <= i) b = 1000000;
t = l[d[i]];
if(t > a && t > b)
{
printf("IMPOSSIBLE\n");
return 0;
}
if(t > a || ( t<=a && t<=b && b<a))
{
b = t;
ans[d[i]] = 1;
}
else
{
a = t;
ans[d[i]] = 0;
}
}
for(i=1; i<=2*n; i++) printf("%c", ans[d[i]]==1?'v':'^');
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |