# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
642002 | 2022-09-18T08:51:46 Z | Tsiannis | 중앙값 배열 (balkan11_medians) | C++14 | 48 ms | 5676 KB |
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define INF 10000009 int main () { ll n; cin>>n; ll B[n]; for (int i=0;i<n;i++){ cin>>B[i]; } ll A[2*n-1]; ll V[2*n-1]={}; A[0]=B[0]; ll mn=1; ll mx=2*n-1; if (A[0]==1) mn=2; ll idx=1; for (int i=1;i<=2*n-2;i+=2){ if (B[idx]==B[idx-1]) { A[i]=mn; V[A[i]]=1; A[i+1]=mx; V[A[i+1]]=1; } else { A[i]=B[idx]; V[A[i]]=1; if (A[i]==mx) A[i+1]=mn; else A[i+1]=mx; V[A[i+1]]=1; } idx++; while(V[mn]) { mn++; } while(V[mx]) { mx--; } } for (int i=0;i<2*n-1;i++) cout<<A[i]<<' '; cout<<endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Not a permutation |
2 | Incorrect | 1 ms | 212 KB | Not a permutation |
3 | Incorrect | 1 ms | 212 KB | Not a permutation |
4 | Incorrect | 1 ms | 212 KB | Not a permutation |
5 | Incorrect | 1 ms | 212 KB | Not a permutation |
6 | Incorrect | 1 ms | 212 KB | Not a permutation |
7 | Incorrect | 0 ms | 212 KB | Not a permutation |
8 | Incorrect | 0 ms | 212 KB | Not a permutation |
9 | Incorrect | 1 ms | 300 KB | Not a permutation |
10 | Incorrect | 0 ms | 212 KB | Not a permutation |
11 | Incorrect | 1 ms | 212 KB | Not a permutation |
12 | Incorrect | 1 ms | 212 KB | Not a permutation |
13 | Incorrect | 1 ms | 340 KB | Not a permutation |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 308 KB | Not a permutation |
2 | Incorrect | 2 ms | 468 KB | Not a permutation |
3 | Incorrect | 4 ms | 724 KB | Not a permutation |
4 | Incorrect | 8 ms | 1108 KB | Not a permutation |
5 | Incorrect | 14 ms | 2028 KB | Not a permutation |
6 | Incorrect | 29 ms | 3636 KB | Not a permutation |
7 | Incorrect | 48 ms | 5676 KB | Not a permutation |