| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 49471 | SpaimaCarpatilor | City (JOI17_city) | C++17 | 542 ms | 64280 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 "Encoder.h"
#include<bits/stdc++.h>
using namespace std;
const int maxN = 250000, K = 252, maxM = 1000000;
int nr = 0, l[250009], length[250009], a[50009], firstAfter[maxM];
long long partialS[250009];
vector < int > v[250009];
void initA ()
{
a[1] = 1;
for (int i=2; i<=K; i++)
{
a[i] = (int) ((double) a[i - 1] * 1.05);
if (a[i] <= a[i - 1]) a[i] = a[i - 1] + 1;
}
int j = 1;
for (int i=1; i<=a[K]; i++)
{
while (a[j] < i)
j ++;
firstAfter[i] = j;
}
}
void dfs (int nod, int tata)
{
l[nod] = ++nr;
for (auto it : v[nod])
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||