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>
#include <stack>
#include <memory.h>
using namespace std;
int N, A[600500], L[300500], R[300500];
stack<int> stk[2];
// an 2^n approach
int main() {
scanf("%d", &N);
for(int i = 1; i <= N+N; i++) {
scanf("%d", &A[i]);
if(L[A[i]]) R[A[i]] = i; else L[A[i]] = i;
}
for(int state = 0; state < (1<<N); state++) {
for(int i = 0; i < 2; i++) while(!stk[i].empty()) stk[i].pop();
bool valid = true;
for(int i = 1; i <= N+N && valid; i++){
int d = (state >> (A[i]-1)) & 1;
if(i == L[A[i]]) stk[d].push(A[i]);
else {
if(stk[d].empty() || stk[d].top() != A[i]) valid = false;
else stk[d].pop();
}
}
if(valid) {
for(int i = 1; i <= N+N; i++) {
putchar(((state >> (A[i] - 1)) & 1) ? '^' : 'v');
}
return 0;
}
}
puts("INVALID");
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... |