# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
79807 | Vinhspm | Tug of War (BOI15_tug) | C++14 | 1470 ms | 16700 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 pb push_back
#define fi first
#define se second
typedef pair<int, int> ii;
const int N = 2e5 + 5;
const int M = 20 * 30000;
const int oo = 1e9;
ii a[N];
int n, maxn, sum, suma, cnt, curval, total, las, nex = 1;
int cost[N], deg[N], f[2][40 * 30005];
bool alive[N];
vector<int> vi[N];
map<int, int> val;
void bad() { cout << "NO"; exit(0); }
void upd(int &x, int y) { x = min(x, y); }
void addeg(int u, int v) {
deg[u] ++; deg[v] ++;
vi[u].pb(v); vi[v].pb(u);
}
void kill(int u) {
int u1 = 0, tmp = 0;
for(int v: vi[u]) if(!alive[v]) {
u1 = v; tmp ++;
}
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... |