Submission #26897

# Submission time Handle Problem Language Result Execution time Memory
26897 2017-07-07T03:43:14 Z wangyenjen City (JOI17_city) C++14
18 / 100
521 ms 59128 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> G[MAX_N];
static int lb[MAX_N] , rb[MAX_N];

static int dfs(int u , int fa) {
    lb[u] = rb[u] = ++dfs_clock;
    for(int v : G[u]) {
        if(v != fa) rb[u] = max(rb[u] , dfs(v , u));
    }
    return rb[u];
}

void Encode(int N , int A[] , int B[]) {
    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++) Code(i , (ll)lb[i]<<19|rb[i]);
}
/// Author: Wang, Yen-Jen
#include "Device.h"
#include <bits/stdc++.h>

using namespace std;

void InitDevice() {
}

int Answer(long long S , long long T) {
    int sl = S>>19;
    int sr = S&((1<<19)-1);
    int tl = T>>19;
    int tr = T&((1<<19)-1);
    if(tl <= sl && sr <= tr) return 0;
    else if(sl <= tl && tr <= sr) return 1;
	else return 2;
}
# Verdict Execution time Memory Grader output
1 Correct 9 ms 12544 KB Output is correct
2 Correct 9 ms 12288 KB Output is correct
3 Correct 9 ms 12544 KB Output is correct
4 Correct 8 ms 12544 KB Output is correct
5 Correct 8 ms 12544 KB Output is correct
6 Correct 9 ms 12288 KB Output is correct
7 Correct 9 ms 12288 KB Output is correct
8 Correct 7 ms 12544 KB Output is correct
9 Correct 7 ms 12288 KB Output is correct
10 Correct 7 ms 12288 KB Output is correct
11 Correct 7 ms 12288 KB Output is correct
12 Correct 9 ms 12544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 170 ms 19568 KB Output is partially correct - L = 367002300
2 Partially correct 168 ms 19568 KB Output is partially correct - L = 366478011
3 Partially correct 167 ms 19504 KB Output is partially correct - L = 367002300
4 Partially correct 169 ms 19392 KB Output is partially correct - L = 367002300
5 Partially correct 490 ms 57480 KB Output is partially correct - L = 131072250000
6 Partially correct 521 ms 57896 KB Output is partially correct - L = 131072250000
7 Partially correct 509 ms 57784 KB Output is partially correct - L = 131072250000
8 Partially correct 521 ms 57072 KB Output is partially correct - L = 131072250000
9 Partially correct 432 ms 58832 KB Output is partially correct - L = 131072250000
10 Partially correct 464 ms 58952 KB Output is partially correct - L = 131072250000
11 Partially correct 440 ms 59000 KB Output is partially correct - L = 131072250000
12 Partially correct 427 ms 59128 KB Output is partially correct - L = 131072250000
13 Partially correct 433 ms 58416 KB Output is partially correct - L = 131072250000
14 Partially correct 441 ms 58000 KB Output is partially correct - L = 131072250000
15 Partially correct 175 ms 21888 KB Output is partially correct - L = 367002300
16 Partially correct 168 ms 21832 KB Output is partially correct - L = 367002300
17 Partially correct 167 ms 21744 KB Output is partially correct - L = 367002300
18 Partially correct 491 ms 58064 KB Output is partially correct - L = 131072250000
19 Partially correct 471 ms 58336 KB Output is partially correct - L = 131072250000
20 Partially correct 489 ms 58152 KB Output is partially correct - L = 131072250000
21 Partially correct 447 ms 57984 KB Output is partially correct - L = 131072250000
22 Partially correct 484 ms 57952 KB Output is partially correct - L = 131072250000
23 Partially correct 492 ms 57904 KB Output is partially correct - L = 131072250000
24 Partially correct 498 ms 57416 KB Output is partially correct - L = 131072250000
25 Partially correct 498 ms 57552 KB Output is partially correct - L = 131072250000
26 Partially correct 501 ms 57488 KB Output is partially correct - L = 131072250000
27 Partially correct 516 ms 57152 KB Output is partially correct - L = 131072250000