Submission #39606381

Source Code Expand

#include <cstdio>
#include <algorithm>

using namespace std;

int N;
const int MAXN=2e5+7;
int A[MAXN];
bool vis[MAXN];

int main(){
    scanf("%d",&N);
    for(int i=1;i<=N;i++) scanf("%d",A+i);

    for(int i=1;i<=N;i++){
        if (!vis[i]) vis[A[i]]=true;
    }

    int ans=0;
    for(int i=1;i<=N;i++){
        if (vis[i]) continue;
        ans++;
    }
    printf("%d\n",ans);
    for(int i=1;i<=N;i++){
        if (vis[i]) continue;
        printf("%d ",i);
    }
    putchar('\n');
    

    return 0;
}

Submission Info

Submission Time
Task B - Call the ID Number
User cre_chan
Language C++ (Clang 10.0.0)
Score 200
Code Size 545 Byte
Status AC
Exec Time 39 ms
Memory 4120 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 16
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 9 ms 2984 KiB
001.txt AC 39 ms 3760 KiB
002.txt AC 27 ms 3956 KiB
003.txt AC 35 ms 3968 KiB
004.txt AC 35 ms 3984 KiB
005.txt AC 9 ms 3072 KiB
006.txt AC 23 ms 3452 KiB
007.txt AC 17 ms 3348 KiB
008.txt AC 21 ms 3504 KiB
009.txt AC 36 ms 3956 KiB
010.txt AC 36 ms 3968 KiB
011.txt AC 36 ms 4000 KiB
012.txt AC 37 ms 4008 KiB
013.txt AC 38 ms 4120 KiB
example0.txt AC 3 ms 3104 KiB
example1.txt AC 2 ms 2996 KiB