Submission #3363714


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;

template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> v(m), checked(n, 0);
    for (int i = 0; i < m; ++i) {
        int k;
        cin >> k;
        v[m-i-1] = k-1;
    }
    for (int i = 0; i < m; ++i) {
        if(!checked[v[i]]){
            printf("%d\n", v[i]+1);
            checked[v[i]] = 1;
        }
    }
    for (int i = 0; i < n; ++i) {
        if(!checked[i]) printf("%d\n", i+1);
    }
    return 0;
}

Submission Info

Submission Time
Task A - 掲示板
User firiexp
Language C++14 (GCC 5.4.1)
Score 100
Code Size 754 Byte
Status AC
Exec Time 39 ms
Memory 1536 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 14
AC × 30
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 20 ms 1280 KB
subtask2_01.txt AC 4 ms 512 KB
subtask2_02.txt AC 30 ms 1280 KB
subtask2_03.txt AC 10 ms 384 KB
subtask2_04.txt AC 12 ms 640 KB
subtask2_05.txt AC 30 ms 1408 KB
subtask2_06.txt AC 31 ms 1408 KB
subtask2_07.txt AC 25 ms 640 KB
subtask2_08.txt AC 20 ms 768 KB
subtask2_09.txt AC 10 ms 512 KB
subtask2_10.txt AC 39 ms 1536 KB
subtask2_11.txt AC 39 ms 1536 KB
subtask2_12.txt AC 39 ms 1536 KB
subtask2_13.txt AC 38 ms 1536 KB
subtask2_14.txt AC 38 ms 1536 KB
subtask2_15.txt AC 37 ms 1536 KB