Submission #2968231
Source Code Expand
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; const int INF=INT_MAX,MOD=1e9+7; int main(){ int n,m; cin>>n>>m; int a[m]; rep(i,m) cin>>a[i]; reverse(a,a+m); bool b[n]; rep(i,n) b[i]=1; rep(i,m){ if(b[a[i]-1]){ cout<<a[i]<<endl; b[a[i]-1]=0; } } rep(i,n){ if(b[i]) cout<<i+1<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | ChiyosBigDragon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 441 Byte |
Status | AC |
Exec Time | 192 ms |
Memory | 1280 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 | 156 ms | 1024 KB |
subtask2_01.txt | AC | 35 ms | 384 KB |
subtask2_02.txt | AC | 136 ms | 1024 KB |
subtask2_03.txt | AC | 16 ms | 384 KB |
subtask2_04.txt | AC | 63 ms | 640 KB |
subtask2_05.txt | AC | 176 ms | 1152 KB |
subtask2_06.txt | AC | 169 ms | 1152 KB |
subtask2_07.txt | AC | 46 ms | 640 KB |
subtask2_08.txt | AC | 71 ms | 640 KB |
subtask2_09.txt | AC | 46 ms | 512 KB |
subtask2_10.txt | AC | 190 ms | 1280 KB |
subtask2_11.txt | AC | 188 ms | 1280 KB |
subtask2_12.txt | AC | 191 ms | 1280 KB |
subtask2_13.txt | AC | 192 ms | 1280 KB |
subtask2_14.txt | AC | 189 ms | 1280 KB |
subtask2_15.txt | AC | 189 ms | 1280 KB |