# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100975 | KLPP | Wand (COCI19_wand) | C++14 | 53 ms | 2304 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;
int main(){
int n,m;
scanf("%d %d",&n,&m);
int victory[n];
int fail[n];
for(int i=0;i<n;i++){
victory[i]=0;
fail[i]=0;
}
for(int i=0;i<m;i++){
int x,y;
scanf("%d %d",&x,&y);
x--;y--;
victory[x]++;
fail[y]++;
}
for(int i=0;i<n;i++){
if(victory[i]>0 || (victory[i]+fail[i]==0)){
cout<<1;
}else cout<<0;
}cout<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |