Submission #8534319
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define MOD 1000000007 //#define MOD 998244353 const double EPS = 1e-9; #define INF (1LL<<60) #define D double #define fs first #define sc second #define int long long #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define RFOR(i,a,b) for(int i = (b-1);i>=(a);--i) #define REP(i,n) FOR(i,0,(n)) #define RREP(i,n) RFOR(i,0,(n)) #define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ++itr) #define RITR(itr,mp) for(auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr) #define range(i,a,b) ((a)<=(i) && (i)<(b)) #define debug(x) cout << #x << " = " << (x) << endl; #define SP << " " << typedef pair<int,int> P; typedef vector<int> vec; typedef vector<vector<int>> mat; signed main(){ ios::sync_with_stdio(false); cin.tie(0); int n,m; cin >> n >> m; vector<int> a(m); REP(i,m) { cin >> a[i]; a[i]--; } vector<bool> used(n,false); vector<int> ans; RREP(i,m){ if(!used[a[i]]){ used[a[i]] = true; ans.push_back(a[i]); } } REP(i,n){ if(!used[i]){ ans.push_back(i); } } REP(i,n){ cout << ans[i] + 1 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | NikuKyabe |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1217 Byte |
Status | AC |
Exec Time | 159 ms |
Memory | 2548 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 | 135 ms | 1908 KB |
subtask2_01.txt | AC | 34 ms | 640 KB |
subtask2_02.txt | AC | 114 ms | 2040 KB |
subtask2_03.txt | AC | 8 ms | 640 KB |
subtask2_04.txt | AC | 56 ms | 1148 KB |
subtask2_05.txt | AC | 155 ms | 2292 KB |
subtask2_06.txt | AC | 139 ms | 2164 KB |
subtask2_07.txt | AC | 25 ms | 1280 KB |
subtask2_08.txt | AC | 55 ms | 1404 KB |
subtask2_09.txt | AC | 37 ms | 1020 KB |
subtask2_10.txt | AC | 157 ms | 2548 KB |
subtask2_11.txt | AC | 155 ms | 2548 KB |
subtask2_12.txt | AC | 157 ms | 2548 KB |
subtask2_13.txt | AC | 158 ms | 2548 KB |
subtask2_14.txt | AC | 159 ms | 2548 KB |
subtask2_15.txt | AC | 154 ms | 2548 KB |