# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
148413 | 2019-09-01T04:20:04 Z | test team(#3596, leesongun, einsu5, willi19) | List of Unique Integers (FXCUP4_unique) | C++17 | 6 ms | 512 KB |
#include "unique.h" #include <bits/stdc++.h> using namespace std; vector<int> PickUnique(int n) { vector<int> ret; if(UniqueCount(0,n-1)-UniqueCount(1,n-1)==1) ret.push_back(1); else ret.push_back(0); for(int i=1;i<n-1;i++) { if(UniqueCount(0,i)-UniqueCount(0,i-1)==1&&UniqueCount(i,n-1)-UniqueCount(i+1,n-1)==1) ret.push_back(1); else ret.push_back(0); } if(UniqueCount(0,n-1)-UniqueCount(0,n-2)==1) ret.push_back(1); else ret.push_back(0); return ret; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Correct : C = 4 |
2 | Correct | 5 ms | 384 KB | Correct : C = 14 |
3 | Correct | 5 ms | 384 KB | Correct : C = 76 |
4 | Correct | 5 ms | 384 KB | Correct : C = 166 |
5 | Correct | 5 ms | 256 KB | Correct : C = 166 |
6 | Correct | 5 ms | 384 KB | Correct : C = 240 |
7 | Correct | 6 ms | 384 KB | Correct : C = 322 |
8 | Partially correct | 6 ms | 512 KB | Partially correct : C = 494 |
9 | Partially correct | 5 ms | 384 KB | Partially correct : C = 570 |
10 | Partially correct | 6 ms | 512 KB | Partially correct : C = 650 |
11 | Partially correct | 6 ms | 384 KB | Partially correct : C = 658 |
12 | Partially correct | 6 ms | 512 KB | Partially correct : C = 642 |
13 | Partially correct | 6 ms | 512 KB | Partially correct : C = 650 |
14 | Correct | 6 ms | 512 KB | Correct : C = 400 |
15 | Partially correct | 6 ms | 512 KB | Partially correct : C = 796 |