#include "Encoder.h"
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
namespace {
const int NN = 1e5 + 10;
vector<int> adj[NN];
bool vis[NN];
int cnt = -1;
}
void dfs(int u, int p) {
vis[u] = 1;
int st = ++cnt;
for(int &v : adj[u]) if (v != p) dfs(v, u);
int diff = 1, deg = 0;
while (diff < cnt - st) diff *= 2, deg++;
cnt = st + diff;
long long code = st * 19 + deg;
// cout << st << " " << cnt << " " << deg << " " << u << endl;
assert(code < (1 << 27));
Code(u, code);
}
void Encode(int N, int A[], int B[])
{
for(int i = 0; i < N - 1; i++) {
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
}
for(int i = 0; i < N; i++) if (!vis[i]) dfs(i, i);
}
#include "Device.h"
#include<bits/stdc++.h>
using namespace std;
void InitDevice()
{
}
int Answer(long long S, long long T)
{
long long st_x = S / 19;
long long ed_x = st_x + (1 << (S % 19));
long long st_y = T / 19;
long long ed_y = st_y + (1 << (T % 19));
// cout << st_x << " " << ed_x << endl;
// cout << st_y << " " << ed_y << endl;
if (st_x <= st_y && st_y <= ed_x) return 1;
if (st_y <= st_x && st_x <= ed_y) return 0;
return 2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
8976 KB |
Output is correct |
2 |
Correct |
2 ms |
8976 KB |
Output is correct |
3 |
Correct |
1 ms |
8976 KB |
Output is correct |
4 |
Correct |
1 ms |
8992 KB |
Output is correct |
5 |
Correct |
1 ms |
8992 KB |
Output is correct |
6 |
Correct |
1 ms |
8992 KB |
Output is correct |
7 |
Correct |
1 ms |
8988 KB |
Output is correct |
8 |
Correct |
1 ms |
8984 KB |
Output is correct |
9 |
Correct |
3 ms |
8992 KB |
Output is correct |
10 |
Correct |
2 ms |
8980 KB |
Output is correct |
11 |
Correct |
3 ms |
9232 KB |
Output is correct |
12 |
Correct |
1 ms |
8980 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
128 ms |
23416 KB |
Output is correct - L = 175256 |
2 |
Correct |
128 ms |
23588 KB |
Output is correct - L = 1246191 |
3 |
Correct |
124 ms |
23644 KB |
Output is correct - L = 181811 |
4 |
Correct |
128 ms |
23608 KB |
Output is correct - L = 726655 |
5 |
Runtime error |
54 ms |
16624 KB |
Execution killed with signal 11 |
6 |
Halted |
0 ms |
0 KB |
- |