| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 318558 | mohamedsobhi777 | City (JOI17_city) | C++14 | 537 ms | 46220 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>
#include "Encoder.h"
const int MAX = 5e5;
using namespace std;
vector<int> adj[MAX], seq;
long long st[MAX], en[MAX], T;
const int L = 250000 + 1;
const double app = 1.0556451;
void build()
{
seq.push_back(0);
for (int i = 0; i < 256; ++i)
{
int x = seq.back();
x = x * app;
if (x == seq.back())
++x;
seq.push_back(x);
}
}
void dfs(int x, int p)
{
st[x] = ++T;
for (auto u : adj[x])
{
if (u == p)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||