oj.uz

답안 #250935

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250935 2020-07-19T13:31:14 Z imeimi2000 City (JOI17_city) C++17
100 / 100
 584 ms 70616 KB 
#include "Encoder.h"
#include <vector>
#include <cmath>
#include <algorithm>
 
using namespace std;
typedef long long llong;
 
static const int MAXN = 2.5e5;
static const double mul = 1.021;
static vector<int> ls;
 
static void pushElement() {
    int x = ls.back();
    int y = x * mul;
    if (x == y) ++y;
    ls.push_back(y);
}
 
static void init() {
    ls.clear();
    ls.push_back(1);
    while (ls.back() <= MAXN) pushElement();
    for (int i = 0; i < 20; ++i) pushElement();
}
 
static int n;
static vector<int> edge[MAXN];
static int st[MAXN];
static int sz[MAXN];
static int ord;
 
static int lowbound(int x) {
    return lower_bound(ls.begin(), ls.end(), x) - ls.begin();
}
 
static void dfs(int x, int p) {
    st[x] = ord++;
    for (int i : edge[x]) {
        if (i == p) continue;
        dfs(i, x);
    }
    int l = lowbound(ord - st[x]);
    ord = st[x] + ls[sz[x] = l];
}
 
void Encode(int N, int A[], int B[]) {
	n = N;
	for (int i = 0; i < n; ++i) edge[i].clear();
	init();
	for (int i = 0; i < n - 1; ++i) {
        edge[A[i]].push_back(B[i]);
        edge[B[i]].push_back(A[i]);
	}
	ord = 0;
	dfs(0, -1);
	for (int i = 0; i < n; ++i) {
        Code(i, st[i] * ls.size() + sz[i]);
	}
}
#include "Device.h"
#include <vector>
#include <cmath>
#include <algorithm>
 
using namespace std;
typedef long long llong;
 
static const int MAXN = 2.5e5;
static const double mul = 1.021;
static vector<int> ls;
 
static void pushElement() {
    int x = ls.back();
    int y = x * mul;
    if (x == y) ++y;
    ls.push_back(y);
}
 
static void init() {
    ls.clear();
    ls.push_back(1);
    while (ls.back() <= MAXN) pushElement();
    for (int i = 0; i < 20; ++i) pushElement();
}
 
void InitDevice() {
    init();
}
 
int Answer(llong S, llong T) {
    int st1 = S / ls.size();
    int st2 = T / ls.size();
    int ed1 = st1 + ls[S % ls.size()] - 1;
    int ed2 = st2 + ls[T % ls.size()] - 1;
    if (st1 <= st2 && ed2 <= ed1) return 1;
    if (st2 <= st1 && ed1 <= ed2) return 0;
	return 2;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12288 KB Output is correct
2 Correct 3 ms 12288 KB Output is correct
3 Correct 6 ms 12288 KB Output is correct
4 Correct 4 ms 12288 KB Output is correct
5 Correct 3 ms 12288 KB Output is correct
6 Correct 3 ms 12288 KB Output is correct
7 Correct 4 ms 12288 KB Output is correct
8 Correct 4 ms 12288 KB Output is correct
9 Correct 3 ms 12288 KB Output is correct
10 Correct 6 ms 12288 KB Output is correct
11 Correct 4 ms 12288 KB Output is correct
12 Correct 3 ms 12288 KB Output is correct

Subtask #2
92.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 26608 KB Output is correct - L = 361188
2 Correct 215 ms 26608 KB Output is correct - L = 362204
3 Correct 210 ms 26608 KB Output is correct - L = 357124
4 Correct 209 ms 26608 KB Output is correct - L = 360172
5 Correct 532 ms 69176 KB Output is correct - L = 135866632
6 Correct 515 ms 69016 KB Output is correct - L = 136931908
7 Correct 521 ms 69144 KB Output is correct - L = 135383016
8 Correct 523 ms 68848 KB Output is correct - L = 140786612
9 Correct 441 ms 70616 KB Output is correct - L = 167854376
10 Correct 474 ms 70616 KB Output is correct - L = 168844976
11 Correct 452 ms 70616 KB Output is correct - L = 179622704
12 Correct 462 ms 70616 KB Output is correct - L = 172313092
13 Correct 506 ms 70112 KB Output is correct - L = 151992584
14 Correct 520 ms 69360 KB Output is correct - L = 141529816
15 Correct 212 ms 26576 KB Output is correct - L = 358140
16 Correct 210 ms 26608 KB Output is correct - L = 364744
17 Correct 209 ms 26464 KB Output is correct - L = 357632
18 Correct 488 ms 69600 KB Output is correct - L = 175929544
19 Correct 484 ms 69344 KB Output is correct - L = 126999492
20 Correct 477 ms 69344 KB Output is correct - L = 126999492
21 Correct 505 ms 69600 KB Output is correct - L = 165297612
22 Correct 501 ms 69344 KB Output is correct - L = 127029464
23 Correct 561 ms 69344 KB Output is correct - L = 127372364
24 Correct 580 ms 69208 KB Output is correct - L = 128328420
25 Correct 505 ms 69360 KB Output is correct - L = 128525524
26 Correct 516 ms 69104 KB Output is correct - L = 128592580
27 Correct 584 ms 69104 KB Output is correct - L = 129267204