# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49105 | aome | Tug of War (BOI15_tug) | C++17 | 647 ms | 41368 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;
const int N = 30005;
int n, m, sum;
int a[2 * N];
int deg[4 * N];
int par[4 * N];
int b[20 * N];
int f[20 * N];
bool vis[4 * N];
vector<int> G[4 * N];
vector<int> vec[4 * N];
int find(int u) { return u == par[u] ? u : par[u] = find(par[u]); }
void join(int u, int v) { par[find(u)] = find(v); }
void add(int u, int v) {
// cout << u << ' ' << v << '\n';
deg[u]++, deg[v]++, G[u].push_back(v), G[v].push_back(u), join(u, v);
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= 4 * n; ++i) par[i] = i;
for (int i = 1; i <= 2 * n; ++i) {
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... |