oj.uz

Submission #12792

# Submission time Handle Problem Language Result Execution time Memory
12792 2015-01-03T13:55:04 Z woqja125 전선 연결하기 (GA9_wire) C++
0 / 100
 0 ms 5776 KB 
#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;
}

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5776 KB Output is correct
2 Correct 0 ms 5776 KB Output is correct
3 Incorrect 0 ms 5776 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #3
0.0 / 37.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -

Subtask #4
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -