| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 101123 | gs14004 | City (JOI17_city) | C++17 | 523 ms | 56896 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 = 250005;
vector<int> generate_seq(){
double rat = 1.05;
vector<int> v = {1};
while(v.size() < 256){
int curV = (int)round(rat);
if(curV != v.back()) v.push_back(curV);
rat *= 1.05;
}
return v;
}
vector<int> seq;
vector<int> gph[MAXN];
int dfn[MAXN], sz[MAXN], piv;
void dfs(int x, int p){
sz[x] = 1;
dfn[x] = ++piv;
for(auto &i : gph[x]){
if(i != p){
dfs(i, x);
sz[x] += sz[i];
}
}
while(!binary_search(seq.begin(), seq.end(), sz[x])){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||