# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
682088 | ethening | Dango Maker (JOI18_dango_maker) | C++17 | 272 ms | 262144 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;
using ll = long long;
// RGW
int n, m;
string s[3005];
int a[3005][3005];
int cnt, cnt2;
template<class T>
struct dinic {
static constexpr T INF = numeric_limits<T>::max();
struct edge {
int v, r; T c;
edge(int _v, int _r, T _c) : v{_v}, r{_r}, c{_c} {}
};
int n, s, t;
vector<vector<edge>> G;
vector<int> d, arc;
dinic(int _n, int _s, int _t) : n{_n}, s{_s}, t{_t}, G(_n) {}
void add_edge(int u, int v, T c) {
G[u].emplace_back(v, (int)G[v].size(), c);
G[v].emplace_back(u, (int)G[u].size() - 1, 0);
}
int bfs() {
d.assign(n, 0), arc.assign(n, 0);
queue<int> q;
d[s] = 1, q.emplace(s);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |