# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729364 | pcc | Dango Maker (JOI18_dango_maker) | C++14 | 0 ms | 0 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;
#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
const int mxn = 3030;
struct edge{
int to;
int id;
int cap;
edge(){}
};
edge edges[mxn*mxn*6];
vector<int> paths[mxn*mxn*2];
int ppp = 0;
void solve(){
return 0;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t;cin>>t;
}