#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]);
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
12288 KB |
Output is correct |
2 |
Correct |
11 ms |
12288 KB |
Output is correct |
3 |
Correct |
8 ms |
12288 KB |
Output is correct |
4 |
Correct |
9 ms |
12544 KB |
Output is correct |
5 |
Incorrect |
9 ms |
12288 KB |
Wrong Answer [6] |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
172 ms |
19440 KB |
Output is partially correct - L = 367003000 |
2 |
Partially correct |
168 ms |
19480 KB |
Output is partially correct - L = 366478710 |
3 |
Partially correct |
165 ms |
19408 KB |
Output is partially correct - L = 367003000 |
4 |
Incorrect |
162 ms |
19440 KB |
Wrong Answer [6] |
5 |
Halted |
0 ms |
0 KB |
- |