Submission #3430567
Source Code Expand
#include<bits/stdc++.h> using namespace std; int main() { bool used[100010] = {}; int n, m; cin >> n >> m; int a[100010]; for (int i = 0; i < m; i++) cin >> a[i]; for (int i = m - 1; i >= 0; i--) { if (!used[a[i]]) { cout << a[i] << endl; used[a[i]] = true; } } for (int i = 1; i <= n; i++) { if (!used[i]) { cout << i << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | xuelei |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 421 Byte |
Status | AC |
Exec Time | 187 ms |
Memory | 1408 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 | 384 KB |
sample_02.txt | AC | 1 ms | 384 KB |
sample_03.txt | AC | 1 ms | 384 KB |
subtask1_00.txt | AC | 1 ms | 384 KB |
subtask1_01.txt | AC | 1 ms | 384 KB |
subtask1_02.txt | AC | 1 ms | 384 KB |
subtask1_03.txt | AC | 1 ms | 384 KB |
subtask1_04.txt | AC | 1 ms | 384 KB |
subtask1_05.txt | AC | 1 ms | 384 KB |
subtask1_06.txt | AC | 1 ms | 384 KB |
subtask1_07.txt | AC | 1 ms | 384 KB |
subtask1_08.txt | AC | 1 ms | 384 KB |
subtask1_09.txt | AC | 1 ms | 384 KB |
subtask1_10.txt | AC | 1 ms | 384 KB |
subtask2_00.txt | AC | 149 ms | 1024 KB |
subtask2_01.txt | AC | 35 ms | 512 KB |
subtask2_02.txt | AC | 135 ms | 1024 KB |
subtask2_03.txt | AC | 15 ms | 512 KB |
subtask2_04.txt | AC | 64 ms | 640 KB |
subtask2_05.txt | AC | 172 ms | 1152 KB |
subtask2_06.txt | AC | 162 ms | 1152 KB |
subtask2_07.txt | AC | 46 ms | 768 KB |
subtask2_08.txt | AC | 70 ms | 768 KB |
subtask2_09.txt | AC | 45 ms | 512 KB |
subtask2_10.txt | AC | 187 ms | 1408 KB |
subtask2_11.txt | AC | 185 ms | 1280 KB |
subtask2_12.txt | AC | 186 ms | 1280 KB |
subtask2_13.txt | AC | 186 ms | 1280 KB |
subtask2_14.txt | AC | 187 ms | 1280 KB |
subtask2_15.txt | AC | 185 ms | 1280 KB |