# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539432 | Antekb | Dango Maker (JOI18_dango_maker) | C++14 | 739 ms | 185744 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 st first
#define nd second
using namespace std;
using ll=long long;
const int N=3005, M=3e6+5;
const ll INF=1e18;
vector<int> E[M];
int vis[M], match[M];
int co[N][N], poz[N][N], pio[N][N];
int col=1;
bool dfs(int v){
vis[v]=col;
for(int u:E[v]){
if(!match[u]){
match[u]=v;
return 1;
}
else{
if(vis[match[u]]!=col && dfs(match[u])){
match[u]=v;
return 1;
}
}
}
return 0;
}
int main(){
int n, m;
cin>>n>>m;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |