Submission #2525747
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <vector> #include <utility> #include <cmath> #include <iomanip> #include <queue> #include <map> #include <set> #include <random> #include <sstream> #include <stack> #include <deque> using namespace std; #define REP(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) REP(i,0,n) typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vl; int N, M; set<int> st; int main() { cin >> N >> M; int a[M]; vi res; rep(i,M) cin >> a[i]; for (int i = M-1; i >= 0; i--) { if (!st.count(a[i])) { res.push_back(a[i]); st.insert(a[i]); } } REP(i,1,N+1) { if (!st.count(i)) res.push_back(i); } rep(i,N) cout << res[i] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | bluenote |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 859 Byte |
Status | AC |
Exec Time | 220 ms |
Memory | 6264 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 | 161 ms | 2680 KB |
subtask2_01.txt | AC | 36 ms | 640 KB |
subtask2_02.txt | AC | 154 ms | 3448 KB |
subtask2_03.txt | AC | 17 ms | 512 KB |
subtask2_04.txt | AC | 70 ms | 1660 KB |
subtask2_05.txt | AC | 195 ms | 3832 KB |
subtask2_06.txt | AC | 185 ms | 3832 KB |
subtask2_07.txt | AC | 54 ms | 1280 KB |
subtask2_08.txt | AC | 81 ms | 2044 KB |
subtask2_09.txt | AC | 50 ms | 1408 KB |
subtask2_10.txt | AC | 220 ms | 4600 KB |
subtask2_11.txt | AC | 215 ms | 4600 KB |
subtask2_12.txt | AC | 217 ms | 4600 KB |
subtask2_13.txt | AC | 218 ms | 4600 KB |
subtask2_14.txt | AC | 214 ms | 4600 KB |
subtask2_15.txt | AC | 215 ms | 6264 KB |