#include "Encoder.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
namespace{
using vi = vector<int>;
using vvi = vector<vi>;
#define sz(x) int(x.size())
const int mx = 250'000;
using ll = long long;
using vll = vector<ll>;
int N;
vi edge[mx];
vll code(mx, 0);
vll dfsind(mx, 0);
vll subtree(mx, 1);
int ct = -1;
void dfs(int u, int p)
{
// cerr << "dfs " << u << '\n';
dfsind[u] = ++ct;
for(int v : edge[u])
{
if(v == p) continue;
dfs(v, u);
subtree[u] += subtree[v];
}
}
}
void Encode(int N_, int A[], int B[])
{
N = N_;
for(int e = 0; e < N-1; e++)
{
edge[A[e]].push_back(B[e]);
edge[B[e]].push_back(A[e]);
}
// cerr << "done\n";
dfs(0, -1);
// cerr << "done2\n";
for(int i = 0; i < N; i++)
{
// cerr << i << " : " << dfsind[i] << ' ' << subtree[i] << ' ' << ((dfsind[i]<<18) | subtree[i]) << '\n';
Code(i, (dfsind[i] << 18) | subtree[i]);
}
}
#include "Device.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
namespace
{
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
#define sz(x) int(x.size())
}
void InitDevice()
{
;
}
int Answer(long long S, long long T)
{
ll s_ind = S>>18;
ll s_st = S & ((1<<18) - 1);
ll t_ind = T>>18;
ll t_st = T & ((1<<18) - 1);
// cerr << S << ' ' << T << " : " << s_ind << ' ' << s_st << " | " << t_ind << ' ' << t_st << "\n";
if(t_ind <= s_ind && s_ind + s_st <= t_ind + t_st)
return 0;
else if(s_ind <= t_ind && t_ind + t_st <= s_ind + s_st)
return 1;
else
return 2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
12328 KB |
Output is correct |
2 |
Correct |
6 ms |
12328 KB |
Output is correct |
3 |
Correct |
6 ms |
12328 KB |
Output is correct |
4 |
Correct |
6 ms |
12336 KB |
Output is correct |
5 |
Correct |
6 ms |
12332 KB |
Output is correct |
6 |
Correct |
6 ms |
12328 KB |
Output is correct |
7 |
Correct |
6 ms |
12336 KB |
Output is correct |
8 |
Correct |
6 ms |
12336 KB |
Output is correct |
9 |
Correct |
6 ms |
12324 KB |
Output is correct |
10 |
Correct |
6 ms |
12336 KB |
Output is correct |
11 |
Correct |
6 ms |
12340 KB |
Output is correct |
12 |
Correct |
6 ms |
12336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
162 ms |
20968 KB |
Output is correct - L = 183238657 |
2 |
Correct |
166 ms |
20880 KB |
Output is correct - L = 182976513 |
3 |
Correct |
154 ms |
20836 KB |
Output is correct - L = 183238657 |
4 |
Correct |
173 ms |
21128 KB |
Output is correct - L = 183238657 |
5 |
Partially correct |
361 ms |
49492 KB |
Output is partially correct - L = 65535737857 |
6 |
Partially correct |
381 ms |
56432 KB |
Output is partially correct - L = 65535737857 |
7 |
Partially correct |
370 ms |
56372 KB |
Output is partially correct - L = 65535737857 |
8 |
Partially correct |
408 ms |
56240 KB |
Output is partially correct - L = 65535737857 |
9 |
Partially correct |
335 ms |
57312 KB |
Output is partially correct - L = 65535737857 |
10 |
Partially correct |
307 ms |
57428 KB |
Output is partially correct - L = 65535737857 |
11 |
Partially correct |
321 ms |
57468 KB |
Output is partially correct - L = 65535737857 |
12 |
Partially correct |
315 ms |
57376 KB |
Output is partially correct - L = 65535737857 |
13 |
Partially correct |
345 ms |
56972 KB |
Output is partially correct - L = 65535737857 |
14 |
Partially correct |
378 ms |
56612 KB |
Output is partially correct - L = 65535737857 |
15 |
Correct |
178 ms |
27928 KB |
Output is correct - L = 183238657 |
16 |
Correct |
161 ms |
27776 KB |
Output is correct - L = 183238657 |
17 |
Correct |
161 ms |
27912 KB |
Output is correct - L = 183238657 |
18 |
Partially correct |
350 ms |
56544 KB |
Output is partially correct - L = 65535737857 |
19 |
Partially correct |
378 ms |
56596 KB |
Output is partially correct - L = 65535737857 |
20 |
Partially correct |
366 ms |
56524 KB |
Output is partially correct - L = 65535737857 |
21 |
Partially correct |
358 ms |
56592 KB |
Output is partially correct - L = 65535737857 |
22 |
Partially correct |
351 ms |
56580 KB |
Output is partially correct - L = 65535737857 |
23 |
Partially correct |
364 ms |
56860 KB |
Output is partially correct - L = 65535737857 |
24 |
Partially correct |
371 ms |
56656 KB |
Output is partially correct - L = 65535737857 |
25 |
Partially correct |
383 ms |
56612 KB |
Output is partially correct - L = 65535737857 |
26 |
Partially correct |
384 ms |
56536 KB |
Output is partially correct - L = 65535737857 |
27 |
Partially correct |
384 ms |
56436 KB |
Output is partially correct - L = 65535737857 |