Submission #8533904


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 1e9 + 7;

int p[1000001] = {};

int main() {
  int n, m;
  cin >> n >> m;
  int p[n + 1] = {};
  vector<int> a(m);
  rep(i, m) cin >> a[i];
  repr(i, m) {
    if (p[a[i]] == 0) {
      cout << a[i] << endl;
      p[a[i]]++;
    }
  }
  repi(i, 1, n + 1) {
    if (p[i] == 0) cout << i << endl;
  }
  return 0;
}

Submission Info

Submission Time
Task A - 掲示板
User ryota101020
Language C++14 (GCC 5.4.1)
Score 100
Code Size 627 Byte
Status AC
Exec Time 193 ms
Memory 1664 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 150 ms 1280 KB
subtask2_01.txt AC 36 ms 512 KB
subtask2_02.txt AC 134 ms 1280 KB
subtask2_03.txt AC 14 ms 384 KB
subtask2_04.txt AC 66 ms 640 KB
subtask2_05.txt AC 172 ms 1408 KB
subtask2_06.txt AC 167 ms 1408 KB
subtask2_07.txt AC 42 ms 640 KB
subtask2_08.txt AC 68 ms 768 KB
subtask2_09.txt AC 46 ms 512 KB
subtask2_10.txt AC 183 ms 1536 KB
subtask2_11.txt AC 184 ms 1536 KB
subtask2_12.txt AC 186 ms 1536 KB
subtask2_13.txt AC 184 ms 1536 KB
subtask2_14.txt AC 193 ms 1536 KB
subtask2_15.txt AC 184 ms 1664 KB