Submission #2550841
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; int MAX_M = 100005; int main () { int n, m; scanf("%d %d", &n, &m); int a[MAX_M]; int u[MAX_M]; for (int i=0; i<m; i++) { scanf("%d", &a[i]); u[i] = false; } for (int i=m-1; i>=0; i--) { if (u[a[i]] == false) { printf("%d\n", a[i]); u[a[i]] = true; } } for (int i=1; i<m+1; i++) { if (u[i] == false) printf("%d\n", i); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 掲示板 |
User | vjudge3 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 459 Byte |
Status | WA |
Exec Time | 20 ms |
Memory | 1536 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &n, &m); ^ ./Main.cpp:13:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i]); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 1 ms | 256 KB |
subtask1_02.txt | WA | 1 ms | 256 KB |
subtask1_03.txt | WA | 1 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | WA | 1 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | WA | 1 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | WA | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask2_00.txt | WA | 10 ms | 1024 KB |
subtask2_01.txt | WA | 2 ms | 384 KB |
subtask2_02.txt | WA | 16 ms | 1280 KB |
subtask2_03.txt | WA | 7 ms | 768 KB |
subtask2_04.txt | WA | 7 ms | 640 KB |
subtask2_05.txt | WA | 16 ms | 1408 KB |
subtask2_06.txt | WA | 16 ms | 1408 KB |
subtask2_07.txt | WA | 17 ms | 1536 KB |
subtask2_08.txt | WA | 12 ms | 1024 KB |
subtask2_09.txt | WA | 6 ms | 640 KB |
subtask2_10.txt | AC | 20 ms | 1536 KB |
subtask2_11.txt | AC | 20 ms | 1536 KB |
subtask2_12.txt | AC | 20 ms | 1536 KB |
subtask2_13.txt | AC | 20 ms | 1536 KB |
subtask2_14.txt | AC | 20 ms | 1536 KB |
subtask2_15.txt | AC | 19 ms | 1536 KB |