# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
148512 | 2019-09-01T04:34:34 Z | Powered By Zigui(#3580, aaaa, evenharder, best_sheild97) | List of Unique Integers (FXCUP4_unique) | C++17 | 6 ms | 512 KB |
#include "unique.h" int l[202], r[202]; std::vector<int> ans; std::vector<int> PickUnique(int N) { int x = UniqueCount(0, N-1); for(int i=0;i<N;i++) { if(i == 0) l[1] = 1; else l[i+1] = UniqueCount(0, i); if(i == 0) r[N] = 1; else r[N-i] = UniqueCount(N-i-1, N-1); } ans.resize(N); for(int i=0;i<N;i++) { ans[i] = (l[i] < l[i+1] && r[i+1] > r[i+2]); } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Correct : C = 3 |
2 | Correct | 5 ms | 256 KB | Correct : C = 9 |
3 | Correct | 5 ms | 384 KB | Correct : C = 49 |
4 | Correct | 6 ms | 384 KB | Correct : C = 99 |
5 | Correct | 5 ms | 384 KB | Correct : C = 99 |
6 | Correct | 5 ms | 384 KB | Correct : C = 153 |
7 | Correct | 5 ms | 444 KB | Correct : C = 199 |
8 | Correct | 5 ms | 384 KB | Correct : C = 299 |
9 | Correct | 6 ms | 512 KB | Correct : C = 355 |
10 | Correct | 6 ms | 512 KB | Correct : C = 399 |
11 | Correct | 6 ms | 512 KB | Correct : C = 399 |
12 | Correct | 5 ms | 512 KB | Correct : C = 399 |
13 | Correct | 5 ms | 512 KB | Correct : C = 399 |
14 | Correct | 5 ms | 512 KB | Correct : C = 399 |
15 | Correct | 5 ms | 512 KB | Correct : C = 399 |