| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 72700 | IvanC | City (JOI17_city) | C++11 | 542 ms | 56728 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 = 250010;
typedef long long ll;
typedef pair<int,int> ii;
static vector<int> grafo[MAXN],sequencia;
static int ini[MAXN],idx[MAXN],dfsCount;
static void build_sequence(){
const long double factor = 1.055645;
sequencia.push_back(0);
sequencia.push_back(1);
for(int i = 2;i<256;i++){
int x = int( factor*sequencia.back() );
if(x == sequencia.back()) x += 1;
sequencia.push_back(x);
}
}
static void dfs(int v,int p){
ini[v] = ++dfsCount;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||