# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310598 | Ruxandra985 | Tug of War (BOI15_tug) | C++14 | 1085 ms | 9752 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>
#define DIMN 30010
using namespace std;
int n;
int f[4 * DIMN] , gr[4 * DIMN];
vector <pair <int , int> > v[4 * DIMN];
deque <int> dq;
bitset <20 * DIMN> rcs;
void dfs (int nod , int &val){
int i , vecin , cst;
f[nod] = 1;
for (i = 0 ; i < v[nod].size() ; i++){
vecin = v[nod][i].first;
cst = v[nod][i].second;
if (f[vecin])
continue;
if (vecin > 2 * n && vecin <= 3 * n){ /// il bagi in a
val += cst;
}
else if (vecin > 3 * n) { /// il bagi in b
val -= cst;
}
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... |