# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596044 | AGE | Sob (COCI19_sob) | C++14 | 375 ms | 57128 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>
#define F first
#define S second
#define pb push_back
#define int long long
using namespace std;
const int N=2e6+10,M=2e3,mod=10;
int vis[N],cnt=1,mt[N];
vector<int>adj[N];
bool trykuhn(int node){
if(vis[node]==cnt)
return 0;
vis[node]=cnt;
for(auto x:adj[node]){
if(mt[x]==-1){
mt[x]=node;
return 1;
}
}
for(auto x:adj[node]){
if(trykuhn(mt[x])){
mt[x]=node;return 1;
}
}
return 0;
}
main()
{
int n,m;
cin>>n>>m;
if(n+m<=1000){
for(int i=0;i<n;i++){
for(int j=m;j<n+m;j++){
if((i&j)==i)
adj[i].pb(j),adj[j].pb(i);
}
}
for(int i=0;i<n+m;i++)
mt[i]=-1;
for(int i=0;i<n;i++){
trykuhn(i),cnt++;
}
for(int i=0;i<n;i++)
cout<<mt[i+m]<<" "<<i+m<<endl;
}
else{
vector<pair<int,int>>v;
for(int i=m;i<n+m;i++){
bitset<32>bt;
int num=0;
bt=i;
for(int j=0;j<31;j++){
if(bt[j]==1){
num+=(1<<j);
if(vis[num]==0){
vis[num]=1;
break;
}
}
}
if(num==n){
num=0;
}
v.pb({num,i});
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
cout<<v[i].F<<" "<<v[i].S<<endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |