Codeforces Round #532 (Div. 2), problem: (B)

B. Build a Contest
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Arkady coordinates rounds on some not really famous competitive programming platform. Each round features n problems of distinct difficulty, the difficulties are numbered from 1 to n.

To hold a round Arkady needs n new (not used previously) problems, one for each difficulty. As for now, Arkady creates all the problems himself, but unfortunately, he can’t just create a problem of a desired difficulty. Instead, when he creates a problem, he evaluates its difficulty from 1 to n and puts it into the problems pool.

At each moment when Arkady can choose a set of n new problems of distinct difficulties from the pool, he holds a round with these problems and removes them from the pool. Arkady always creates one problem at a time, so if he can hold a round after creating a problem, he immediately does it.

You are given a sequence of problems’ difficulties in the order Arkady created them. For each problem, determine whether Arkady held the round right after creating this problem, or not. Initially the problems pool is empty.

Input
The first line contains two integers n and m (1≤n,m≤105) — the number of difficulty levels and the number of problems Arkady created.

The second line contains m integers a1,a2,…,am (1≤ai≤n) — the problems’ difficulties in the order Arkady created them.

Output
Print a line containing m digits. The i-th digit should be 1 if Arkady held the round after creation of the i-th problem, and 0 otherwise.

Examples
inputCopy
3 11
2 3 1 2 2 2 3 2 2 3 1
outputCopy
00100000001
inputCopy
4 8
4 1 3 3 2 3 3 3
outputCopy
00001000
Note
In the first example Arkady held the round after the first three problems, because they are of distinct difficulties, and then only after the last problem.
用一个数组存各个回合的问题数，达到n则输出1；
#include<bits/stdc++.h>
typedef long long ll;
typedef double db;
#define dep(i,a,b) for(int i=(a);i>=(b);i–)
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define mes§ memset(p,0,sizeof§)
using namespace std;
int main()
{
int n,m,cnt[100005],r[100005],ji=0;//r存第几个回合的次数
mes®;mes(cnt);
cin>>n>>m;
rep(i,1,m){
int b;
scanf("%d",&b);
cnt[b]++;
r[cnt[b]]++;
if(r[cnt[b]]==n)
printf(“1”);
else printf(“0”);
}
return 0;
}