oj.uz

Submission #1005456

# Submission time Handle Problem Language Result Execution time Memory
1005456 2024-06-22T13:06:27 Z 79brue City (JOI17_city) C++17
8 / 100
 211 ms 46020 KB 
#include "Encoder.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

namespace{
    const int M = 300;
    int n;
    ll len[512] = {0};
    void init(){
        for(int i=1; i<=M; i++){
            len[i] = round(double(len[i-1]) * 1.05);
            if(len[i] == len[i-1]) len[i]++;
        }
    }

    vector<int> link[250005];
    ll in[250005], out[250002], inCnt=0, t[250002];

    void dfs(int x, int p=-1){
        in[x] = ++inCnt;
        for(int y: link[x]){
            if(y==p) continue;
            dfs(y, x);
        }
        t[x] = lower_bound(len, len+M+1, inCnt - in[x]) - len;
        inCnt = out[x] = in[x] + len[t[x]];
    }

    void encode(int N, int A[], int B[]){
        init();
        n = N;
        for(int i=0; i<n-1; i++) link[A[i]].push_back(B[i]), link[B[i]].push_back(A[i]);

        dfs(0);
        for(int i=0; i<n; i++){
            assert(in[i] < (1<<19));
//            assert(out[i] - in[i] < len[255]);
            Code(i, in[i] << 8 | t[i]);
        }
    }
}

void Encode(int N, int A[], int B[]){
    encode(N, A, B);
}

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

using namespace std;

typedef long long ll;

namespace{
    const int M = 300;
    ll len[512] = {0};
    void init(){
        for(int i=1; i<=M; i++){
            len[i] = round(double(len[i-1]) * 1.05);
            if(len[i] == len[i-1]) len[i]++;
        }
    }
}

void InitDevice(){
    init();
}

int Answer(ll S, ll T){
    ll SL = S >> 8, SR = SL + len[S & 255];
    ll TL = T >> 8, TR = TL + len[T & 255];
    if(SL<=TL&&TR<=SR) return 1;
    if(TL<=SL&&SR<=TR) return 0;
    return 2;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 20644 KB Output is correct - L = 190208
2 Correct 89 ms 20896 KB Output is correct - L = 198656
3 Correct 87 ms 20636 KB Output is correct - L = 187392
4 Correct 89 ms 20868 KB Output is correct - L = 190208
5 Correct 192 ms 41096 KB Output is correct - L = 77004032
6 Correct 187 ms 41132 KB Output is correct - L = 79570688
7 Correct 199 ms 41096 KB Output is correct - L = 78318848
8 Correct 211 ms 40672 KB Output is correct - L = 89360384
9 Correct 190 ms 41668 KB Output is correct - L = 127458048
10 Correct 183 ms 41768 KB Output is correct - L = 126135040
11 Runtime error 56 ms 46020 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -