1100B - Build a Contest - CodeForces Solution

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <stack>
#include <functional>
#include <list>
#include <sstream>

using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define debug(a) cout<<#a<<"="<<a<<endl
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef double db;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

const int N = 1e5+10;

int a[N];
int cnt[N];
int ans[N];

void solve()
{
	int n,m;
	cin >> n >> m;
	rep(i,1,m)
		ans[i] = n;
	rep(i,1,m){
		int x;
		cin >> x;
		cnt[x]++;
		ans[cnt[x]]--;
		if(ans[cnt[x]] == 0)
			cout << 1;
		else
			cout << 0;
	}
	cout << endl;
}

int main()
{
	IOS;
	
	int t;
	t = 1;
	while(t--){
		solve();
	}

 	return 0;
}