# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31727 | 2017-09-03T00:23:34 Z | simotion | medians (balkan11_medians) | C++14 | 26 ms | 2600 KB |
#include <bits/stdc++.h> using namespace std; bool used[200005]; int inp[100000],n,li,hi; void low_next() { while(used[li]) li++; printf("%d ",li),used[li]=true; } void high_next() { while(used[hi]) hi--; printf("%d ",hi),used[hi]=true; } int main() { scanf("%d",&n); li=1,hi=2*n-1; for(int i=0;i<n;i++) scanf("%d",&inp[i]); printf("%d ",inp[0]),used[inp[0]]=true; for(int i=1;i<n;i++) { if(inp[i-1]==inp[i]) low_next(),high_next(); else if(inp[i-1]<inp[i]) { if(used[inp[i]]) high_next(),high_next(); else { high_next(); printf("%d ",inp[i]),used[inp[i]]=true; } } else { if(used[inp[i]]) low_next(),low_next(); else { low_next(); printf("%d ",inp[i]),used[inp[i]]=true; } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2600 KB | Output is correct |
2 | Correct | 0 ms | 2600 KB | Output is correct |
3 | Correct | 0 ms | 2600 KB | Output is correct |
4 | Correct | 0 ms | 2600 KB | Output is correct |
5 | Correct | 0 ms | 2600 KB | Output is correct |
6 | Correct | 0 ms | 2600 KB | Output is correct |
7 | Correct | 0 ms | 2600 KB | Output is correct |
8 | Correct | 0 ms | 2600 KB | Output is correct |
9 | Correct | 0 ms | 2600 KB | Output is correct |
10 | Correct | 0 ms | 2600 KB | Output is correct |
11 | Correct | 0 ms | 2600 KB | Output is correct |
12 | Correct | 0 ms | 2600 KB | Output is correct |
13 | Correct | 0 ms | 2600 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2600 KB | Output is correct |
2 | Correct | 0 ms | 2600 KB | Output is correct |
3 | Correct | 3 ms | 2600 KB | Output is correct |
4 | Correct | 9 ms | 2600 KB | Output is correct |
5 | Correct | 9 ms | 2600 KB | Output is correct |
6 | Correct | 19 ms | 2600 KB | Output is correct |
7 | Correct | 26 ms | 2600 KB | Output is correct |