| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 11542 |
2014-11-30T15:10:27 Z |
tncks0121 |
전선 연결하기 (GA9_wire) |
C++14 |
|
1000 ms |
5936 KB |
#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 |
| 1 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 16 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 17 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 18 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 19 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 20 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 21 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 22 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 23 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 24 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 25 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 26 |
Correct |
0 ms |
5936 KB |
Output is correct |
| 27 |
Incorrect |
0 ms |
5936 KB |
Output isn't correct |
| 28 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
5936 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1000 ms |
5932 KB |
Program timed out |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
60 ms |
5936 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
