Submission #8538159
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define INF 1LL<<62 #define inf 1000000007 bool ch[100010]; int main() { ll n; cin>>n; vector<ll>a; for(ll i=n;i>=1;i--){ a.push_back(i); } ll m; cin>>m; for(ll i=0;i<m;i++){ ll now; cin>>now; a.push_back(now); } for(;a.size()!=0;){ ll now=a.back(); a.pop_back(); if(ch[now]==false){ ch[now]=true; cout << now<<endl; } } // your code goes here return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | mototakashi |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 490 Byte |
Status | AC |
Exec Time | 186 ms |
Memory | 2544 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 | 145 ms | 1908 KB |
subtask2_01.txt | AC | 35 ms | 640 KB |
subtask2_02.txt | AC | 128 ms | 2420 KB |
subtask2_03.txt | AC | 13 ms | 892 KB |
subtask2_04.txt | AC | 61 ms | 1144 KB |
subtask2_05.txt | AC | 169 ms | 2420 KB |
subtask2_06.txt | AC | 158 ms | 2420 KB |
subtask2_07.txt | AC | 41 ms | 1400 KB |
subtask2_08.txt | AC | 70 ms | 1400 KB |
subtask2_09.txt | AC | 43 ms | 892 KB |
subtask2_10.txt | AC | 180 ms | 2544 KB |
subtask2_11.txt | AC | 180 ms | 2544 KB |
subtask2_12.txt | AC | 181 ms | 2544 KB |
subtask2_13.txt | AC | 186 ms | 2544 KB |
subtask2_14.txt | AC | 181 ms | 2544 KB |
subtask2_15.txt | AC | 179 ms | 2544 KB |