# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528170 | LFFB | Race (IOI11_race) | C++17 | 927 ms | 64664 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 <iostream>
#include <vector>
#include <string>
#define debug(args...) //printf(args)
typedef std::pair<int, int> intPair;
#define forAllChild(node, code) for (intPair childPair : neighbors[node]) {\
int child = childPair.first;\
int childWeight = childPair.second;\
if (child == parent.get(node)) continue;\
if (removed.get(child)) continue;\
code;\
}
const int MAX_N = 1000000 + 10;
const int INF = 1000000000;
template<typename T>
class SpecialVector {
private:
int time;
T values[MAX_N];
T standard;
int lastChanged[MAX_N];
public:
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... |