제출 #113602

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113602		popovicirobert	City (JOI17_city)	C++14	22 / 100	571 ms	56784 KiB

Encoder

#include "Encoder.h"
#include <bits/stdc++.h>
#define ll long long

using namespace std;

static vector < vector <int> > g;
static vector <int> idl, idr;

void dfs(int nod, int par, int &sz) {
    idl[nod] = ++sz;
    for(auto it : g[nod]) {
        if(it != par) {
            dfs(it, nod, sz);
        }
    }
    idr[nod] = sz;
}

void Encode(int n, int A[], int B[]) {

    g.resize(n);
    int i;

    for(i = 0; i < n - 1; i++) {
        g[A[i]].push_back(B[i]);
        g[B[i]].push_back(A[i]);
    }

    idl.resize(n), idr.resize(n);
    int sz = 0;
    dfs(0, -1, sz);

    vector <int> aux = idr;

    sort(aux.begin(), aux.end());
    aux.resize(unique(aux.begin(), aux.end()) - aux.begin());

    for(i = 0; i < n; i++) {
        ll a = idl[i], b = lower_bound(aux.begin(), aux.end(), idr[i]) - aux.begin();
        Code(i, (b << 18) + a);
    }

}

Device

#include "Device.h"
#include <bits/stdc++.h>
#define ll long long

using namespace std;

void InitDevice()
{
}

int Answer(long long S, long long T)
{

    ll ls = (S & ((1 << 18) - 1)), rs = ((S - ls) >> 18);
    ll lt = (T & ((1 << 18) - 1)), rt = ((T - lt) >> 18);

    if(ls <= lt && rt <= rs) {
        return 1;
    }

    if(lt <= ls && rs <= rt) {
        return 0;
    }

	return 2;
}

• Subtask 1: 8 / 8
• Subtask 2: 14 / 92