Submission #2930316

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define gt first
#define gc second.first
#define gr second.second
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	b += MOD;
	a += b;
	a %= MOD;
}

int main(void){
	int n,m,i,a[123456];
	bool done[123456];
	fill(done,done+123456,false);
	for(i=1; i<=m; ++i){
		cin >> a[m-i]; --a[m-i];
	}
	for(i=0; i<m; ++i){
		if(!done[a[i]]){
			cout << (a[i]+1) << endl;
			done[a[i]] = true;
		}
	}
	for(i=0; i<n; ++i){
		if(!done[i]){
			cout << (i+1) << endl;
			done[i] = true;
		}
	}
	return 0;
}

Submission Info

Judge Result