oj.uz

Submission #26912

# Submission time Handle Problem Language Result Execution time Memory
26912 2017-07-07T06:22:15 Z wangyenjen City (JOI17_city) C++14
98 / 100
 585 ms 56816 KB 
/// Author: Wang, Yen-Jen
#include "Encoder.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

static const int MAX_N = 250000 + 7;

static int dfs_clock;
static vector<int> table;
static vector<int> G[MAX_N];
static int lb[MAX_N] , rb[MAX_N];

static void build_table() {
    int x = 1;
    table.push_back(x);
    while(x <= 5 * MAX_N) {
        int x2 = x * 1.05;
        if(x2 == x) x2++;
        table.push_back(x2);
        x = x2;
    }
    table.pop_back();
}

static void dfs(int u , int fa) {
    lb[u] = ++dfs_clock;
    for(int v : G[u]) {
        if(v != fa) dfs(v , u);
    }
    dfs_clock = rb[u] = lb[u] + *lower_bound(table.begin() , table.end() , dfs_clock - lb[u]);
}

void Encode(int N , int A[] , int B[]) {
    build_table();
    for(int i = 0; i < N; i++) G[i].clear();
    for(int i = 0; i < N - 1; i++) {
        G[A[i]].push_back(B[i]);
        G[B[i]].push_back(A[i]);
    }
    dfs_clock = 0;
    dfs(0 , -1);
    for(int i = 0; i < N; i++) {
        int x = lower_bound(table.begin() , table.end() , rb[i] - lb[i]) - table.begin();
        Code(i , (ll)lb[i] * (int)table.size() + x);
    }
}

/// Author: Wang, Yen-Jen
#include "Device.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

static const int MAX_N = 250000 + 7;

static vector<int> table;

static void build_table() {
    int x = 1;
    table.push_back(x);
    while(x <= 5 * MAX_N) {
        int x2 = x * 1.05;
        if(x2 == x) x2++;
        table.push_back(x2);
        x = x2;
    }
    table.pop_back();
}

void InitDevice() {
    build_table();
}

int Answer(long long S , long long T) {
    int sl = S / (int)table.size();
    int sr = sl + table[S % (int)table.size()];
    int tl = T / (int)table.size();
    int tr = tl + table[T % (int)table.size()];
    if(tl <= sl && sr <= tr) return 0;
    else if(sl <= tl && tr <= sr) return 1;
	else return 2;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
90.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 19568 KB Output is correct - L = 283985
2 Correct 175 ms 19472 KB Output is correct - L = 295293
3 Correct 193 ms 19704 KB Output is correct - L = 288868
4 Correct 175 ms 19464 KB Output is correct - L = 287840
5 Correct 521 ms 55160 KB Output is correct - L = 115852002
6 Correct 558 ms 55272 KB Output is correct - L = 118042156
7 Correct 517 ms 55328 KB Output is correct - L = 118740682
8 Correct 585 ms 54752 KB Output is correct - L = 132568824
9 Correct 449 ms 56536 KB Output is correct - L = 265266148
10 Correct 427 ms 56816 KB Output is correct - L = 263227367
11 Partially correct 433 ms 56752 KB Output is partially correct - L = 290139379
12 Correct 450 ms 56768 KB Output is correct - L = 263167743
13 Correct 476 ms 55888 KB Output is correct - L = 183222753
14 Correct 482 ms 55448 KB Output is correct - L = 139912085
15 Correct 177 ms 19744 KB Output is correct - L = 289125
16 Correct 177 ms 19440 KB Output is correct - L = 295293
17 Correct 192 ms 19440 KB Output is correct - L = 277560
18 Correct 493 ms 55744 KB Output is correct - L = 206198553
19 Correct 497 ms 55552 KB Output is correct - L = 96534083
20 Correct 499 ms 55712 KB Output is correct - L = 96387593
21 Correct 474 ms 55968 KB Output is correct - L = 216509136
22 Correct 513 ms 55736 KB Output is correct - L = 92075390
23 Correct 501 ms 55896 KB Output is correct - L = 90344238
24 Correct 513 ms 55320 KB Output is correct - L = 88228100
25 Correct 512 ms 55376 KB Output is correct - L = 85471775
26 Correct 541 ms 55336 KB Output is correct - L = 83388533
27 Correct 510 ms 55272 KB Output is correct - L = 83572545