oj.uz

답안 #49416

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49416 2018-05-28T15:57:55 Z SpaimaCarpatilor City (JOI17_city) C++17
8 / 100
 293 ms 40432 KB 
#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;

int nr = 0, l[250009], r[250009];
vector < int > v[250009];

void dfs (int nod, int tata)
{
    l[nod] = ++nr;
    for (auto it : v[nod])
        if (it != tata)
            dfs (it, nod);
    r[nod] = nr;
}

void Encode (int N, int A[], int B[])
{
    for (int i=0; i<N; i++)
        v[A[i]].push_back (B[i]),
        v[B[i]].push_back (A[i]);
    dfs (0, -1);
	for (int i=0; i<N; i++)
		Code(i, (l[i] << 18LL) | r[i]);
}

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

void InitDevice()
{

}

int Answer (long long S, long long T)
{
    int lS = (S >> 18), rS = S & ((1 << 18) - 1);
    int lT = (T >> 18), rT = T & ((1 << 18) - 1);
    if (lT <= lS && rS <= rT) return 0;
    if (lS <= lT && rT <= rS) return 1;
	return 2;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 165 ms 19384 KB Output is partially correct - L = 550504500
2 Partially correct 162 ms 19384 KB Output is partially correct - L = 549718065
3 Partially correct 165 ms 19384 KB Output is partially correct - L = 550504500
4 Partially correct 169 ms 19584 KB Output is partially correct - L = 550504500
5 Incorrect 293 ms 40432 KB Wrong Answer [3]
6 Halted 0 ms 0 KB -