oj.uz

Submission #26921

# Submission time Handle Problem Language Result Execution time Memory
26921 2017-07-07T06:34:34 Z wangyenjen City (JOI17_city) C++14
8 / 100
 518 ms 56512 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;

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);
    int cnt = 0;
    while(x < 4.87 * MAX_N) {
        int x2 = x * 1.05;
        if(x2 == x) x2++;
        if(x2 > MAX_N) cnt++;
        table.push_back(x2);
        x = x2;
    }
    while(cnt > 21) {
        table.pop_back();
        cnt--;
    }
}

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;

static vector<int> table;

static void build_table() {
    int x = 1;
    table.push_back(x);
    int cnt = 0;
    while(x < 4.87 * MAX_N) {
        int x2 = x * 1.05;
        if(x2 == x) x2++;
        if(x2 > MAX_N) cnt++;
        table.push_back(x2);
        x = x2;
    }
    while(cnt > 21) {
        table.pop_back();
        cnt--;
    }
}

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 8 ms 12288 KB Output is correct
2 Correct 8 ms 12288 KB Output is correct
3 Correct 8 ms 12288 KB Output is correct
4 Correct 9 ms 12544 KB Output is correct
5 Correct 9 ms 12288 KB Output is correct
6 Correct 8 ms 12544 KB Output is correct
7 Correct 8 ms 12544 KB Output is correct
8 Correct 8 ms 12488 KB Output is correct
9 Correct 8 ms 12288 KB Output is correct
10 Correct 9 ms 12544 KB Output is correct
11 Correct 8 ms 12288 KB Output is correct
12 Correct 7 ms 12288 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 19440 KB Output is correct - L = 270725
2 Correct 172 ms 19696 KB Output is correct - L = 281505
3 Correct 170 ms 19480 KB Output is correct - L = 275380
4 Correct 170 ms 19384 KB Output is correct - L = 274400
5 Correct 482 ms 55264 KB Output is correct - L = 110442570
6 Correct 518 ms 55328 KB Output is correct - L = 112530460
7 Correct 497 ms 55352 KB Output is correct - L = 113196370
8 Correct 476 ms 54776 KB Output is correct - L = 126378840
9 Incorrect 420 ms 56512 KB Wrong Answer [6]
10 Halted 0 ms 0 KB -