Submission #2550083
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i,s, t) for(int i = s; i < t; i++) #define ALL(a) (a).begin(),(a).end() int main() { int n, m; cin >> n >> m; vector<int> a(m); FOR(i, 0, m) cin >> a[i]; reverse(ALL(a)); vector<int>b(n); FOR(i, 0, n) b[i] = 0; FOR(i, 0, m) { if (b[a[i] - 1] == 0) { cout << a[i] << endl; b[a[i] - 1] = 1; } } FOR(i, 0, n) { if (b[i] == 0) cout << i + 1 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 448 Byte |
Status | AC |
Exec Time | 181 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 | 146 ms | 1280 KB |
subtask2_01.txt | AC | 34 ms | 512 KB |
subtask2_02.txt | AC | 127 ms | 1280 KB |
subtask2_03.txt | AC | 13 ms | 384 KB |
subtask2_04.txt | AC | 62 ms | 640 KB |
subtask2_05.txt | AC | 170 ms | 1408 KB |
subtask2_06.txt | AC | 158 ms | 1408 KB |
subtask2_07.txt | AC | 41 ms | 768 KB |
subtask2_08.txt | AC | 66 ms | 768 KB |
subtask2_09.txt | AC | 43 ms | 512 KB |
subtask2_10.txt | AC | 180 ms | 1536 KB |
subtask2_11.txt | AC | 179 ms | 1664 KB |
subtask2_12.txt | AC | 179 ms | 1664 KB |
subtask2_13.txt | AC | 178 ms | 1536 KB |
subtask2_14.txt | AC | 180 ms | 1664 KB |
subtask2_15.txt | AC | 181 ms | 1664 KB |