# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
174510 | emil_physmath | Hard route (IZhO17_road) | C++17 | 1208 ms | 163964 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.
// #define DEBUG
// #define STRESS_TESTING
#define ALL_LL
#include <algorithm>
#include <vector>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <map>
using namespace std;
typedef long long llong;
#ifdef ALL_LL
#define int long long
#endif
const int maxN = 500005;
vector<int> nei[maxN];
pair<int, int> ray[maxN][3];
map<llong, llong> ans;
vector<pair<int, int>> dists[maxN];
namespace AC
{
int n;
pair<int, int> maxdist[maxN];
bool used[maxN];
void MaxDist(int u);
pair<int, int> DFS(int u, int dep, int dist);
void Solve(int n_)
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... |