# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853392 | willychan | Dango Maker (JOI18_dango_maker) | C++14 | 447 ms | 243280 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 int ll;
//#include<bits/extc++.h>
//__gnu_pbds
const int MAXN = 3e6;
struct edge{
int to;
ll cap;
int rev;
};
vector<edge> side[MAXN];
int level[MAXN];
int nxt[MAXN];
struct DINIC{
int n;
void init(int s){
n = s;
for(int i=0;i<n;i++) side[i].clear();
}
void add_edge(int a,int b,ll c){
// cout<<a<<"->"<<b<<"\n";
side[a].push_back({b,c,(int)(side[b].size())});
side[b].push_back({a,0,(int)(side[a].size()-1)});
}
bool bfs(int s,int t){
fill(level,level+n,-1);
queue<int> q;
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... |