# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
50213 | 2018-06-08T10:25:04 Z | rondojim | 중앙값 배열 (balkan11_medians) | C++17 | 300 ms | 16408 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int A[2 * MAXN], B[MAXN], N, cnt[2 * MAXN]; set<int> S; int main(){ scanf("%d", &N); for(int i=1; i<=N; ++i){ scanf("%d", &B[i]); cnt[B[i]]++; } for(int i=1; i<2*N; ++i) S.insert(i); for(int i=1; i<N; ++i){ if(S.find(B[i]) != S.end()) S.erase(S.find(B[i])); } A[1] = B[1]; for(int i=N; i>=2; --i){ int p = B[i - 1], c = B[i]; set<int>::iterator it; if(c > p){ for(int j=2*i-1; j>=2*i-2; --j){ auto it = S.lower_bound(B[i]); A[j] = *it; S.erase(it); } } else if(c < p){ for(int j=2*i-1; j>=2*i-2; --j){ it = S.lower_bound(B[i - 1]); if(*it >= B[i - 1]) --it; A[j] = *it; S.erase(it); } } else{ it = S.upper_bound(B[i]); A[2 * i - 1] = *it; S.erase(it); it = S.lower_bound(B[i]); if(*it >= B[i]) --it; A[2 * i - 2] = *it; if(it != S.end()) S.erase(it); } if(cnt[B[i - 1]] == 1) S.insert(B[i - 1]); else cnt[B[i - 1]]--; } for(int i=1; i<2*N; ++i) printf("%d ", A[i]); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 248 KB | Output is correct |
2 | Runtime error | 5 ms | 740 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
3 | Correct | 2 ms | 740 KB | Output is correct |
4 | Incorrect | 2 ms | 884 KB | Integer 0 violates the range [1, 79] |
5 | Runtime error | 6 ms | 896 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Runtime error | 5 ms | 1072 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
7 | Incorrect | 2 ms | 1072 KB | Integer 0 violates the range [1, 139] |
8 | Runtime error | 5 ms | 1072 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
9 | Execution timed out | 1087 ms | 1072 KB | Time limit exceeded |
10 | Runtime error | 5 ms | 1084 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
11 | Incorrect | 2 ms | 1084 KB | Integer 0 violates the range [1, 599] |
12 | Correct | 2 ms | 1084 KB | Output is correct |
13 | Runtime error | 7 ms | 1164 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 6 ms | 1548 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Correct | 5 ms | 1676 KB | Output is correct |
3 | Runtime error | 12 ms | 2828 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Execution timed out | 1066 ms | 3528 KB | Time limit exceeded |
5 | Runtime error | 36 ms | 7948 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Incorrect | 82 ms | 12312 KB | Integer 0 violates the range [1, 127999] |
7 | Incorrect | 143 ms | 16408 KB | Integer 0 violates the range [1, 199999] |