Submission #2548939
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main(){ long long n,m; cin >> m >> n; long long a[n]; map<long long,long long> mp; for(int i=0;i<n;i++){ cin >> a[i]; } for(int i=n-1;i>=0;i--){ if(mp[a[i]]==0){ cout << a[i] << endl; mp[a[i]]++; } } for(int i=1;i<=m;i++){ if(mp[i]==0){ cout << i << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | MATSUMAT |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 403 Byte |
Status | AC |
Exec Time | 246 ms |
Memory | 7808 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 | 2 ms | 384 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 | 182 ms | 6656 KB |
subtask2_01.txt | AC | 41 ms | 1792 KB |
subtask2_02.txt | AC | 173 ms | 5632 KB |
subtask2_03.txt | AC | 17 ms | 640 KB |
subtask2_04.txt | AC | 78 ms | 2816 KB |
subtask2_05.txt | AC | 214 ms | 7424 KB |
subtask2_06.txt | AC | 205 ms | 7040 KB |
subtask2_07.txt | AC | 57 ms | 1792 KB |
subtask2_08.txt | AC | 88 ms | 2944 KB |
subtask2_09.txt | AC | 55 ms | 2048 KB |
subtask2_10.txt | AC | 246 ms | 7808 KB |
subtask2_11.txt | AC | 239 ms | 7808 KB |
subtask2_12.txt | AC | 241 ms | 7808 KB |
subtask2_13.txt | AC | 239 ms | 7808 KB |
subtask2_14.txt | AC | 239 ms | 7808 KB |
subtask2_15.txt | AC | 241 ms | 7808 KB |