# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126110 | tjd229 | City (JOI17_city) | C++14 | 572 ms | 70616 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 <vector>
using namespace std;
vector<int> edge[250000];
vector<int> range;
int in[250000],p[250000];
int cnt;
void dfs(int x,int from) {
in[x] =cnt++;
for (auto to : edge[x]) {
if (to == from) continue;
dfs(to, x);
}
if (in[x] == cnt - 1) return;
int &e=p[x];
while (in[x] + range[e] < cnt - 1) ++e;
cnt = in[x] + range[e] + 1;
}
void Encode(int N, int A[], int B[])
{
const double r = 1.055645;
//const double r = 1.120438;
range.push_back(0);
for (int i = 1;i<256; ++i) {
int ar = r * range.back();
if (range.back() == ar) ++ar;
range.push_back(ar);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |