Submission #62583187
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
typedef pair<int,int>pii;
const int mod = 1e9+7;
int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = res * a;
a = a * a ;
b >>= 1;
}
return res;
}
int mysqrt(int x) {
int l=0,r=2e9;
int ans=0;
while(l<r){
int mid=(l+r+1)/2;
if((long long)mid*mid<=x)
l=mid;
else r=mid-1;
}
return l;
}
// int C(int n,int x){
// if(n==0&&x==0)return 1;
// return M[n]*X[x]%mod*X[n-x]%mod;
// }
const int N=2e3+10;
//int X[100010],M[100010];
int a[N];
//int h[N];
//int dp[N][3];
char g[N][N];
int n,m,q,k,h;
//int d[N];
//int pre[N];
//int cnt[N],w[N];
string s;
//int p[N];
//vector<int>g[N];
//int sz[N];
void solve()
{
cin>>n>>m;
map<int,int>mp;
for(int i=1;i<=m;i++) {
cin>>a[i];
mp[a[i]]++;
}
cout<<n-mp.size()<<endl;
for(int i = 1;i<=n;i++){
if(mp[i] == 0) cout<<i<<" ";
}
}
signed main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// M[0]=X[0]=1;
// for(int i=1;i<=100000;i++){
// M[i]=M[i-1]*i%mod;
// X[i]=X[i-1]*ksm(i,mod-2)%mod;
// }
// int T;
// cin>>T;
// while(T--)
solve();
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Who is Missing? |
| User | YANG666 |
| Language | C++ 20 (gcc 12.2) |
| Score | 200 |
| Code Size | 1384 Byte |
| Status | AC |
| Exec Time | 4 ms |
| Memory | 3680 KiB |
Compile Error
Main.cpp: In function ‘long long int mysqrt(long long int)’:
Main.cpp:18:9: warning: unused variable ‘ans’ [-Wunused-variable]
18 | int ans=0;
| ^~~
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 | 4 ms | 3492 KiB |
| sample_02.txt | AC | 1 ms | 3488 KiB |
| sample_03.txt | AC | 1 ms | 3496 KiB |
| test_01.txt | AC | 1 ms | 3564 KiB |
| test_02.txt | AC | 1 ms | 3484 KiB |
| test_03.txt | AC | 1 ms | 3612 KiB |
| test_04.txt | AC | 1 ms | 3504 KiB |
| test_05.txt | AC | 1 ms | 3472 KiB |
| test_06.txt | AC | 1 ms | 3496 KiB |
| test_07.txt | AC | 1 ms | 3456 KiB |
| test_08.txt | AC | 1 ms | 3560 KiB |
| test_09.txt | AC | 1 ms | 3564 KiB |
| test_10.txt | AC | 1 ms | 3480 KiB |
| test_11.txt | AC | 1 ms | 3412 KiB |
| test_12.txt | AC | 1 ms | 3452 KiB |
| test_13.txt | AC | 1 ms | 3472 KiB |
| test_14.txt | AC | 1 ms | 3504 KiB |
| test_15.txt | AC | 1 ms | 3444 KiB |
| test_16.txt | AC | 1 ms | 3580 KiB |
| test_17.txt | AC | 1 ms | 3512 KiB |
| test_18.txt | AC | 1 ms | 3504 KiB |
| test_19.txt | AC | 1 ms | 3484 KiB |
| test_20.txt | AC | 1 ms | 3492 KiB |
| test_21.txt | AC | 1 ms | 3440 KiB |
| test_22.txt | AC | 1 ms | 3464 KiB |
| test_23.txt | AC | 1 ms | 3564 KiB |
| test_24.txt | AC | 1 ms | 3580 KiB |
| test_25.txt | AC | 1 ms | 3600 KiB |
| test_26.txt | AC | 1 ms | 3580 KiB |
| test_27.txt | AC | 1 ms | 3460 KiB |
| test_28.txt | AC | 1 ms | 3516 KiB |
| test_29.txt | AC | 1 ms | 3568 KiB |
| test_30.txt | AC | 1 ms | 3572 KiB |
| test_31.txt | AC | 1 ms | 3448 KiB |
| test_32.txt | AC | 1 ms | 3572 KiB |
| test_33.txt | AC | 1 ms | 3680 KiB |
| test_34.txt | AC | 1 ms | 3560 KiB |
| test_35.txt | AC | 1 ms | 3468 KiB |
| test_36.txt | AC | 1 ms | 3500 KiB |
| test_37.txt | AC | 1 ms | 3488 KiB |
| test_38.txt | AC | 1 ms | 3564 KiB |
| test_39.txt | AC | 1 ms | 3492 KiB |
| test_40.txt | AC | 1 ms | 3464 KiB |