Submission #62511894
Source Code Expand
/*
Author : Mikira
Sat 08 Feb 2025 08:04:42 PM HKT
*/
#include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<LL, LL> PLL;
typedef pair<LL, LL> pll;
typedef long double ld;
#define rep(i, a, b) for(int i = a; i < int(b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define popf pop_front
#define pf push_front
#define popb pop_back
#define pb push_back
#define fi first
#define se second
const double EPS = 1e-9;
const int INFMEM = 63;
// Do dir^1 to get reverse direction
const int dx[8] = {0,0,1,-1,1,-1,1,-1};
const int dy[8] = {1,-1,0,0,1,-1,-1,1};
const char dch[4] = {'R','L','D','U'};
// Do (dir + 2)%4 to get reverse direction
// const int dx[8] = {-1,0,1,0,-1,1,1,-1};
// const int dy[8] = {0,1,0,-1,1,1,-1,-1};
// const char dch[4] = {'U','R','D','L'};
const double PI = 3.141592653589793;
inline void fasterios(){
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
}
#define endl '\n'
const int MOD = 1000000007;
// const int MOD = 998244353;
int main(){
fasterios();
int n, m; cin >> n >> m;
set <LL> arr;
rep(i,0,m) {
LL tmp; cin >> tmp;
arr.insert(tmp);
}
vector <LL> ans;
ans.reserve(n);
for(int i = 1;i <= n;i++) {
if(!arr.count(i)) {
ans.pb(i);
}
}
cout << sz(ans) << endl;
trav(cur, ans) cout << cur << " ";
cout << endl;
}
Submission Info
Submission Time |
|
Task |
B - Who is Missing? |
User |
hocky |
Language |
C++ 20 (gcc 12.2) |
Score |
200 |
Code Size |
1612 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
3612 KiB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
3348 KiB |
sample_02.txt |
AC |
1 ms |
3416 KiB |
sample_03.txt |
AC |
1 ms |
3600 KiB |
test_01.txt |
AC |
1 ms |
3592 KiB |
test_02.txt |
AC |
1 ms |
3324 KiB |
test_03.txt |
AC |
1 ms |
3416 KiB |
test_04.txt |
AC |
1 ms |
3472 KiB |
test_05.txt |
AC |
1 ms |
3376 KiB |
test_06.txt |
AC |
1 ms |
3428 KiB |
test_07.txt |
AC |
1 ms |
3496 KiB |
test_08.txt |
AC |
1 ms |
3572 KiB |
test_09.txt |
AC |
1 ms |
3500 KiB |
test_10.txt |
AC |
1 ms |
3540 KiB |
test_11.txt |
AC |
1 ms |
3476 KiB |
test_12.txt |
AC |
1 ms |
3400 KiB |
test_13.txt |
AC |
1 ms |
3420 KiB |
test_14.txt |
AC |
1 ms |
3468 KiB |
test_15.txt |
AC |
1 ms |
3524 KiB |
test_16.txt |
AC |
1 ms |
3448 KiB |
test_17.txt |
AC |
1 ms |
3476 KiB |
test_18.txt |
AC |
1 ms |
3464 KiB |
test_19.txt |
AC |
1 ms |
3452 KiB |
test_20.txt |
AC |
1 ms |
3484 KiB |
test_21.txt |
AC |
1 ms |
3432 KiB |
test_22.txt |
AC |
1 ms |
3524 KiB |
test_23.txt |
AC |
1 ms |
3460 KiB |
test_24.txt |
AC |
1 ms |
3464 KiB |
test_25.txt |
AC |
1 ms |
3476 KiB |
test_26.txt |
AC |
1 ms |
3492 KiB |
test_27.txt |
AC |
1 ms |
3396 KiB |
test_28.txt |
AC |
1 ms |
3484 KiB |
test_29.txt |
AC |
1 ms |
3448 KiB |
test_30.txt |
AC |
1 ms |
3484 KiB |
test_31.txt |
AC |
1 ms |
3464 KiB |
test_32.txt |
AC |
1 ms |
3528 KiB |
test_33.txt |
AC |
1 ms |
3480 KiB |
test_34.txt |
AC |
1 ms |
3504 KiB |
test_35.txt |
AC |
1 ms |
3612 KiB |
test_36.txt |
AC |
1 ms |
3508 KiB |
test_37.txt |
AC |
1 ms |
3452 KiB |
test_38.txt |
AC |
1 ms |
3528 KiB |
test_39.txt |
AC |
1 ms |
3484 KiB |
test_40.txt |
AC |
1 ms |
3544 KiB |