Submission #2550102
Source Code Expand
// // Created by SAJI Ayahito on 2018/05/23. // #include <iostream> using namespace std; int main(void){ long long int N, M; cin >> N >> M; long long int *a = new long long int[M]; bool *used = new bool[N]; for(long long int i = 0;i < M;i++){ cin >> a[i]; a[i] --; } for(long long int i = M-1;i >= 0; i--){ if(used[a[i]] == false){ used[a[i]] = true; cout << (a[i]+1) << endl; } } for(long long int j = 0;j < N;j++){ if(used[j] == false){ cout << (j+1) << endl; } } delete[] a; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | vjudge5 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 626 Byte |
Status | AC |
Exec Time | 186 ms |
Memory | 1664 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt |
Subtask2 | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_00.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask2_00.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_00.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask2_00.txt | AC | 150 ms | 1152 KB |
subtask2_01.txt | AC | 36 ms | 384 KB |
subtask2_02.txt | AC | 130 ms | 1280 KB |
subtask2_03.txt | AC | 13 ms | 512 KB |
subtask2_04.txt | AC | 63 ms | 640 KB |
subtask2_05.txt | AC | 173 ms | 1408 KB |
subtask2_06.txt | AC | 165 ms | 1408 KB |
subtask2_07.txt | AC | 41 ms | 1024 KB |
subtask2_08.txt | AC | 68 ms | 896 KB |
subtask2_09.txt | AC | 44 ms | 640 KB |
subtask2_10.txt | AC | 186 ms | 1664 KB |
subtask2_11.txt | AC | 183 ms | 1664 KB |
subtask2_12.txt | AC | 181 ms | 1664 KB |
subtask2_13.txt | AC | 182 ms | 1664 KB |
subtask2_14.txt | AC | 182 ms | 1664 KB |
subtask2_15.txt | AC | 180 ms | 1664 KB |