# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
698436 |
2023-02-13T13:05:32 Z |
amunduzbaev |
City (JOI17_city) |
C++17 |
|
459 ms |
44768 KB |
#include "Encoder.h"
#include "bits/stdc++.h"
using namespace std;
const int MX = 25e4;
void Encode(int n, int a[], int b[]){
vector<vector<int>> edges(n);
for(int i=0;i+1<n;i++){
edges[a[i]].push_back(b[i]);
edges[b[i]].push_back(a[i]);
}
vector<int> tin(n), tout(n);
int t = 0;
function<void(int, int)> dfs = [&](int u, int p){
tin[u] = ++t;
for(auto x : edges[u]){
if(x == p) continue;
dfs(x, u);
}
tout[u] = t;
};
dfs(0, 0);
for(int i=0;i<n;i++){
tin[i]--, tout[i]--;
Code(i, tin[i] * 1ll * MX + tout[i]);
}
}
#include "Device.h"
#include "bits/stdc++.h"
using namespace std;
const int MX = 25e4;
void InitDevice(){
}
int Answer(long long a, long long b){
int l = a / MX, r = a % MX;
int L = b / MX, R = b % MX;
if(L <= l && r <= R){
return 0;
}
if(l <= L && R <= r){
return 1;
}
return 2;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
520 KB |
Output is correct |
2 |
Correct |
1 ms |
500 KB |
Output is correct |
3 |
Correct |
0 ms |
624 KB |
Output is correct |
4 |
Correct |
1 ms |
528 KB |
Output is correct |
5 |
Correct |
1 ms |
520 KB |
Output is correct |
6 |
Correct |
1 ms |
520 KB |
Output is correct |
7 |
Correct |
2 ms |
520 KB |
Output is correct |
8 |
Correct |
2 ms |
528 KB |
Output is correct |
9 |
Correct |
1 ms |
524 KB |
Output is correct |
10 |
Correct |
1 ms |
528 KB |
Output is correct |
11 |
Correct |
1 ms |
624 KB |
Output is correct |
12 |
Correct |
1 ms |
520 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
159 ms |
16080 KB |
Output is correct - L = 174750699 |
2 |
Correct |
157 ms |
15912 KB |
Output is correct - L = 174500698 |
3 |
Correct |
157 ms |
16116 KB |
Output is correct - L = 174750699 |
4 |
Correct |
158 ms |
16080 KB |
Output is correct - L = 174750699 |
5 |
Partially correct |
410 ms |
44684 KB |
Output is partially correct - L = 62499999999 |
6 |
Partially correct |
386 ms |
44608 KB |
Output is partially correct - L = 62499999999 |
7 |
Partially correct |
401 ms |
44676 KB |
Output is partially correct - L = 62499999999 |
8 |
Partially correct |
426 ms |
44356 KB |
Output is partially correct - L = 62499999999 |
9 |
Partially correct |
345 ms |
44524 KB |
Output is partially correct - L = 62499999999 |
10 |
Partially correct |
331 ms |
44768 KB |
Output is partially correct - L = 62499999999 |
11 |
Partially correct |
353 ms |
44568 KB |
Output is partially correct - L = 62499999999 |
12 |
Partially correct |
359 ms |
44580 KB |
Output is partially correct - L = 62499999999 |
13 |
Partially correct |
386 ms |
44648 KB |
Output is partially correct - L = 62499999999 |
14 |
Partially correct |
459 ms |
44656 KB |
Output is partially correct - L = 62499999999 |
15 |
Correct |
174 ms |
16156 KB |
Output is correct - L = 174750699 |
16 |
Correct |
156 ms |
16124 KB |
Output is correct - L = 174750699 |
17 |
Correct |
163 ms |
16128 KB |
Output is correct - L = 174750699 |
18 |
Partially correct |
374 ms |
44268 KB |
Output is partially correct - L = 62499999999 |
19 |
Partially correct |
365 ms |
44656 KB |
Output is partially correct - L = 62499999999 |
20 |
Partially correct |
379 ms |
44152 KB |
Output is partially correct - L = 62499999999 |
21 |
Partially correct |
374 ms |
44384 KB |
Output is partially correct - L = 62499999999 |
22 |
Partially correct |
403 ms |
44488 KB |
Output is partially correct - L = 62499999999 |
23 |
Partially correct |
420 ms |
44360 KB |
Output is partially correct - L = 62499999999 |
24 |
Partially correct |
401 ms |
44532 KB |
Output is partially correct - L = 62499999999 |
25 |
Partially correct |
415 ms |
44352 KB |
Output is partially correct - L = 62499999999 |
26 |
Partially correct |
438 ms |
44572 KB |
Output is partially correct - L = 62499999999 |
27 |
Partially correct |
390 ms |
44708 KB |
Output is partially correct - L = 62499999999 |