oj.uz

Submission #67269

# Submission time Handle Problem Language Result Execution time Memory
67269 2018-08-13T18:40:13 Z ikura355 City (JOI17_city) C++14
22 / 100
 562 ms 56656 KB 
#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long
const int maxn = 250000 + 5;

int n;
vector<int> way[maxn];
int cur, st[maxn], ft[maxn];

void dfs(int u, int last) {
    st[u] = ++cur;
    for(auto v : way[u]) {
        if(v==last) continue;
        dfs(v,u);
    }
    ft[u] = cur;
}

void Encode(int N, int A[], int B[]) {
    n = N;
    for(int i=0;i<n-1;i++) {
        way[A[i]].push_back(B[i]);
        way[B[i]].push_back(A[i]);
    }
    cur = -1;
    dfs(0,-1);
    for(int i=0;i<n;i++) Code(i,(ll)st[i]*(1<<18) + ft[i]);
}

#include "Device.h"
#include<bits/stdc++.h>
using namespace std;

void InitDevice() {
}

int Answer(long long S, long long T) {
    int lu = S/(1<<18), ru = S%(1<<18);
    int lv = T/(1<<18), rv = T%(1<<18);
    if(lv<=lu && lu<=rv) return 0;
    if(lu<=lv && lv<=ru) return 1;
    return 2;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12288 KB Output is correct
2 Correct 8 ms 12544 KB Output is correct
3 Correct 9 ms 12288 KB Output is correct
4 Correct 7 ms 12544 KB Output is correct
5 Correct 8 ms 12288 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 12288 KB Output is correct
9 Correct 7 ms 12288 KB Output is correct
10 Correct 8 ms 12288 KB Output is correct
11 Correct 8 ms 12288 KB Output is correct
12 Correct 9 ms 12544 KB Output is correct

Subtask #2
14.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 19544 KB Output is correct - L = 183239355
2 Correct 168 ms 19424 KB Output is correct - L = 182977210
3 Correct 170 ms 19520 KB Output is correct - L = 183239355
4 Correct 172 ms 19440 KB Output is correct - L = 183239355
5 Partially correct 493 ms 55536 KB Output is partially correct - L = 65535987855
6 Partially correct 498 ms 55208 KB Output is partially correct - L = 65535987855
7 Partially correct 492 ms 55216 KB Output is partially correct - L = 65535987855
8 Partially correct 464 ms 54800 KB Output is partially correct - L = 65535987855
9 Partially correct 418 ms 56584 KB Output is partially correct - L = 65535987855
10 Partially correct 403 ms 56656 KB Output is partially correct - L = 65535987855
11 Partially correct 403 ms 56528 KB Output is partially correct - L = 65535987855
12 Partially correct 424 ms 56648 KB Output is partially correct - L = 65535987855
13 Partially correct 441 ms 56112 KB Output is partially correct - L = 65535987855
14 Partially correct 472 ms 55528 KB Output is partially correct - L = 65535987855
15 Correct 170 ms 19488 KB Output is correct - L = 183239355
16 Correct 169 ms 19440 KB Output is correct - L = 183239355
17 Correct 172 ms 19384 KB Output is correct - L = 183239355
18 Partially correct 464 ms 55648 KB Output is partially correct - L = 65535987855
19 Partially correct 463 ms 55576 KB Output is partially correct - L = 65535987855
20 Partially correct 485 ms 55768 KB Output is partially correct - L = 65535987855
21 Partially correct 455 ms 55744 KB Output is partially correct - L = 65535987855
22 Partially correct 471 ms 55600 KB Output is partially correct - L = 65535987855
23 Partially correct 460 ms 55728 KB Output is partially correct - L = 65535987855
24 Partially correct 470 ms 55280 KB Output is partially correct - L = 65535987855
25 Partially correct 492 ms 55568 KB Output is partially correct - L = 65535987855
26 Partially correct 518 ms 55280 KB Output is partially correct - L = 65535987855
27 Partially correct 562 ms 55112 KB Output is partially correct - L = 65535987855