oj.uz

Submission #67270

# Submission time Handle Problem Language Result Execution time Memory
67270 2018-08-13T18:42:58 Z ikura355 City (JOI17_city) C++14
22 / 100
 536 ms 60680 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];
ll 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);
    ll wow = (1<<18);
    for(int i=0;i<n;i++) Code(i,st[i]*wow + ft[i]);
}

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

#define ll long long

void InitDevice() {
}

int Answer(long long S, long long T) {
    ll wow = (1<<18);
    ll lu = S/wow, ru = S%wow;
    ll lv = T/wow, rv = T%wow;
    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 12544 KB Output is correct
2 Correct 9 ms 12544 KB Output is correct
3 Correct 9 ms 12544 KB Output is correct
4 Correct 9 ms 12544 KB Output is correct
5 Correct 9 ms 12544 KB Output is correct
6 Correct 9 ms 12544 KB Output is correct
7 Correct 9 ms 12544 KB Output is correct
8 Correct 7 ms 12544 KB Output is correct
9 Correct 8 ms 12544 KB Output is correct
10 Correct 9 ms 12544 KB Output is correct
11 Correct 9 ms 12544 KB Output is correct
12 Correct 8 ms 12544 KB Output is correct

Subtask #2
14.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 19752 KB Output is correct - L = 183239355
2 Correct 180 ms 19440 KB Output is correct - L = 182977210
3 Correct 171 ms 19440 KB Output is correct - L = 183239355
4 Correct 169 ms 19400 KB Output is correct - L = 183239355
5 Partially correct 481 ms 59120 KB Output is partially correct - L = 65535987855
6 Partially correct 517 ms 59152 KB Output is partially correct - L = 65535987855
7 Partially correct 488 ms 59112 KB Output is partially correct - L = 65535987855
8 Partially correct 515 ms 58552 KB Output is partially correct - L = 65535987855
9 Partially correct 434 ms 60488 KB Output is partially correct - L = 65535987855
10 Partially correct 408 ms 60640 KB Output is partially correct - L = 65535987855
11 Partially correct 434 ms 60680 KB Output is partially correct - L = 65535987855
12 Partially correct 399 ms 60568 KB Output is partially correct - L = 65535987855
13 Partially correct 456 ms 59960 KB Output is partially correct - L = 65535987855
14 Partially correct 463 ms 59368 KB Output is partially correct - L = 65535987855
15 Correct 169 ms 19440 KB Output is correct - L = 183239355
16 Correct 174 ms 19440 KB Output is correct - L = 183239355
17 Correct 168 ms 19440 KB Output is correct - L = 183239355
18 Partially correct 475 ms 59528 KB Output is partially correct - L = 65535987855
19 Partially correct 472 ms 59624 KB Output is partially correct - L = 65535987855
20 Partially correct 480 ms 59648 KB Output is partially correct - L = 65535987855
21 Partially correct 461 ms 59600 KB Output is partially correct - L = 65535987855
22 Partially correct 533 ms 59544 KB Output is partially correct - L = 65535987855
23 Partially correct 491 ms 59312 KB Output is partially correct - L = 65535987855
24 Partially correct 485 ms 59240 KB Output is partially correct - L = 65535987855
25 Partially correct 507 ms 59216 KB Output is partially correct - L = 65535987855
26 Partially correct 536 ms 59248 KB Output is partially correct - L = 65535987855
27 Partially correct 521 ms 59120 KB Output is partially correct - L = 65535987855