Submission #62505980


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define pii pair<int,int>
void solve() {
int n,m;
cin >> n >> m;
vector<bool> flag(n+9,1);
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
flag[tmp] = 0;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (flag[i]) ans++;
}
cout << ans << endl;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <bits/stdc++.h>
using namespace std;

#define ull unsigned long long
#define ll long long
#define pii pair<int,int>

void solve() {
    int n,m;
    cin >> n >> m;
    vector<bool> flag(n+9,1);
    for (int i = 0; i < m; i++) {
        int tmp;
        cin >> tmp;
        flag[tmp] = 0;
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        if (flag[i]) ans++; 
    }
    cout << ans << endl;
    for (int i = 1; i <= n; i++) {
        if (flag[i]) cout << i << " ";
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    for (int i = 0; i < t; i++) {
        solve();
    }
    return 0;
}

Submission Info

Submission Time
Task B - Who is Missing?
User CirnoNine
Language C++ 23 (gcc 12.2)
Score 200
Code Size 698 Byte
Status AC
Exec Time 1 ms
Memory 3612 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 43
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 3528 KB
sample_02.txt AC 1 ms 3468 KB
sample_03.txt AC 1 ms 3528 KB
test_01.txt AC 1 ms 3464 KB
test_02.txt AC 1 ms 3604 KB
test_03.txt AC 1 ms 3532 KB
test_04.txt AC 1 ms 3472 KB
test_05.txt AC 1 ms 3432 KB
test_06.txt AC 1 ms 3460 KB
test_07.txt AC 1 ms 3408 KB
test_08.txt AC 1 ms 3468 KB
test_09.txt AC 1 ms 3464 KB
test_10.txt AC 1 ms 3432 KB
test_11.txt AC 1 ms 3412 KB
test_12.txt AC 1 ms 3520 KB
test_13.txt AC 1 ms 3332 KB
test_14.txt AC 1 ms 3420 KB
test_15.txt AC 1 ms 3424 KB
test_16.txt AC 1 ms 3448 KB
test_17.txt AC 1 ms 3612 KB
test_18.txt AC 1 ms 3484 KB
test_19.txt AC 1 ms 3516 KB
test_20.txt AC 1 ms 3476 KB
test_21.txt AC 1 ms 3316 KB
test_22.txt AC 1 ms 3420 KB
test_23.txt AC 1 ms 3472 KB
test_24.txt AC 1 ms 3480 KB
test_25.txt AC 1 ms 3516 KB
test_26.txt AC 1 ms 3468 KB
test_27.txt AC 1 ms 3452 KB
test_28.txt AC 1 ms 3428 KB
test_29.txt AC 1 ms 3284 KB
test_30.txt AC 1 ms 3524 KB
test_31.txt AC 1 ms 3380 KB
test_32.txt AC 1 ms 3480 KB
test_33.txt AC 1 ms 3476 KB
test_34.txt AC 1 ms 3492 KB
test_35.txt AC 1 ms 3420 KB
test_36.txt AC 1 ms 3516 KB
test_37.txt AC 1 ms 3424 KB
test_38.txt AC 1 ms 3424 KB
test_39.txt AC 1 ms 3532 KB
test_40.txt AC 1 ms 3328 KB


2025-03-15 (Sat)
04:40:48 +00:00