oj.uz

Submission #130650

# Submission time Handle Problem Language Result Execution time Memory
130650 2019-07-15T19:06:21 Z RezwanArefin01 City (JOI17_city) C++17
8 / 100
 204 ms 19184 KB 
#include <bits/stdc++.h>
#include "Encoder.h"

using namespace std; 

const int N = 2e5 + 5;
vector<int> a, adj[N];
int in[N], idx; 

void build() {
    double r = pow(2.0, 20.0 / 256.0); 
    a.push_back(1);
    while(a.size() < 256) {
        int x = a.back() * r; 
        if(x == a.back()) ++x; 
        a.push_back(x); 
    } 
}

void dfs(int u, int p) {
    in[u] = idx++;
    for(int v : adj[u]) if(v - p) dfs(v, u); 
    int t = lower_bound(a.begin(), a.end(), idx - in[u]) - a.begin(); 
    idx = in[u] + a[t];; 
    Code(u, ((long long)in[u] << 8) | t);
}   

void Encode(int n, int A[], int B[]) {
    build();
    for(int i = 0; i < n - 1; ++i) {
        adj[A[i]].push_back(B[i]);
        adj[B[i]].push_back(A[i]);
    }

    dfs(0, -1);
}

#include <bits/stdc++.h>
#include "Device.h"

using namespace std; 

vector<int> seq;
void InitDevice() {
    double r = pow(2, 20.0 / 256.0); 
    seq.push_back(1);
    while(seq.size() < 256) {
        int x = seq.back() * r; 
        if(x == seq.back()) ++x; 
        seq.push_back(x); 
    } 
}

int cnt = 0;
int Answer(long long S, long long T) {
    int inu = S >> 8, szu = seq[S & 255];
    int inv = T >> 8, szv = seq[T & 255]; 

    if(inv <= inu && inu < inv + szv) return 0;
    if(inu <= inv && inv < inu + szu) return 1; 
    return 2; 
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9968 KB Output is correct
2 Correct 8 ms 10224 KB Output is correct
3 Correct 8 ms 9968 KB Output is correct
4 Correct 10 ms 9968 KB Output is correct
5 Correct 8 ms 9968 KB Output is correct
6 Correct 8 ms 10224 KB Output is correct
7 Correct 8 ms 10224 KB Output is correct
8 Correct 8 ms 10224 KB Output is correct
9 Correct 8 ms 9968 KB Output is correct
10 Correct 8 ms 9968 KB Output is correct
11 Correct 8 ms 9968 KB Output is correct
12 Correct 8 ms 9968 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 18928 KB Output is correct - L = 191488
2 Correct 204 ms 18872 KB Output is correct - L = 193792
3 Correct 202 ms 19184 KB Output is correct - L = 187136
4 Correct 202 ms 19168 KB Output is correct - L = 188416
5 Runtime error 87 ms 18680 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Halted 0 ms 0 KB -