Submission #10452461

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int n, m;
	cin>>n>>m;
	bool zero=1;
	if(n>1) zero=0;
	int s[10], c[10];
	for(int i=0; i<m; i++){
		cin>>s[i]>>c[i];
		if(c[i]!=0) zero=0;
	}
	if(zero){
		cout<<0<<endl;
		return 0;
	}
	for(int i=1; i<1000; i++){
		int d=0;
		int x=i;
		int t[10];
		while(x){
			t[n-d]=x%10;
			x/=10; d++;
		}
		if(d!=n) continue;
		bool dame=0;
		for(int j=0; j<m; j++){
			if(t[s[j]]!=c[j]){
				dame=1;
			}
		}
		if(!dame){
			cout<<i<<endl;
			return 0;
		}
	}
	cout<<-1<<endl;
	return 0;
}

Submission Info

Judge Result