| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 64547 |
2018-08-04T20:46:26 Z |
zadrga |
City (JOI17_city) |
C++14 |
|
522 ms |
64016 KB |
#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxm 1000111
#define maxn 250111
#define maxk 252
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
int first_over[maxm], a[maxk];
int l[maxn], len[maxn], cnt;
vector<int> adj[maxn];
void init(){
cnt = 0;
for(int i = 0; i < maxn; i++)
adj[i].clear();
a[1] = 1;
for(int i = 2; i < maxk; i++){
a[i] = (double) a[i - 1] * 1.05;
a[i] = max(a[i], a[i - 1] + 1);
}
int ind = 1;
for(int i = 1; i <= a[maxk - 1]; i++){
while(a[ind] < i)
ind++;
first_over[i] = ind;
}
}
void DFS(int x, int p){
l[x] = ++cnt;
for(int v : adj[x]){
if(v == p)
continue;
DFS(v, x);
}
int num = first_over[cnt - l[x] + 1];
cnt = l[x] + a[num] - 1;
len[x] = num;
}
void Encode(int N, int A[], int B[]){
init();
for(int i = 0; i < N - 1; i++){
adj[A[i]].pb(B[i]);
adj[B[i]].pb(A[i]);
}
DFS(0, -1);
for(int i = 0; i < N; i++)
Code(i, 1LL * len[i] * maxm + l[i]);
}
#include "Device.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxm 1000111
#define maxn 250111
#define maxk 252
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
int a1[maxk];
void InitDevice(){
a1[1] = 1;
for(int i = 2; i < maxk; i++){
a1[i] = (double) a1[i - 1] * 1.05;
a1[i] = max(a1[i], a1[i - 1] + 1);
}
}
void decode(ll x, int &l, int &d){
l = x % maxm;
d = l + a1[x / maxm] - 1;
}
int Answer(long long S, long long T){
int la, ra; decode(S, la, ra);
int lb, rb; decode(T, lb, rb);
if(lb <= la && ra <= rb)
return 0;
if(la <= lb && rb <= ra)
return 1;
return 2;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
19712 KB |
Output is correct |
| 2 |
Correct |
11 ms |
19712 KB |
Output is correct |
| 3 |
Correct |
12 ms |
19712 KB |
Output is correct |
| 4 |
Correct |
11 ms |
19712 KB |
Output is correct |
| 5 |
Correct |
12 ms |
19712 KB |
Output is correct |
| 6 |
Correct |
12 ms |
19712 KB |
Output is correct |
| 7 |
Correct |
12 ms |
19712 KB |
Output is correct |
| 8 |
Correct |
12 ms |
19712 KB |
Output is correct |
| 9 |
Correct |
13 ms |
19712 KB |
Output is correct |
| 10 |
Correct |
11 ms |
19712 KB |
Output is correct |
| 11 |
Correct |
12 ms |
19712 KB |
Output is correct |
| 12 |
Correct |
12 ms |
19712 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
171 ms |
26736 KB |
Output is correct - L = 105011656 |
| 2 |
Correct |
172 ms |
26608 KB |
Output is correct - L = 106011767 |
| 3 |
Correct |
174 ms |
26608 KB |
Output is correct - L = 104011545 |
| 4 |
Correct |
175 ms |
26880 KB |
Output is correct - L = 105011656 |
| 5 |
Correct |
474 ms |
62440 KB |
Output is correct - L = 228025309 |
| 6 |
Correct |
481 ms |
62704 KB |
Output is correct - L = 229025420 |
| 7 |
Correct |
504 ms |
62648 KB |
Output is correct - L = 229025420 |
| 8 |
Correct |
522 ms |
62040 KB |
Output is correct - L = 231025642 |
| 9 |
Correct |
408 ms |
63800 KB |
Output is correct - L = 239026530 |
| 10 |
Correct |
435 ms |
63920 KB |
Output is correct - L = 241026752 |
| 11 |
Correct |
428 ms |
63872 KB |
Output is correct - L = 242026863 |
| 12 |
Correct |
402 ms |
64016 KB |
Output is correct - L = 242026863 |
| 13 |
Correct |
445 ms |
63192 KB |
Output is correct - L = 234025975 |
| 14 |
Correct |
471 ms |
62744 KB |
Output is correct - L = 231025642 |
| 15 |
Correct |
173 ms |
26936 KB |
Output is correct - L = 105011656 |
| 16 |
Correct |
173 ms |
26872 KB |
Output is correct - L = 105011656 |
| 17 |
Correct |
174 ms |
26888 KB |
Output is correct - L = 105011656 |
| 18 |
Correct |
449 ms |
62880 KB |
Output is correct - L = 241026752 |
| 19 |
Correct |
465 ms |
62896 KB |
Output is correct - L = 241026752 |
| 20 |
Correct |
454 ms |
63176 KB |
Output is correct - L = 241026752 |
| 21 |
Correct |
464 ms |
62912 KB |
Output is correct - L = 240026641 |
| 22 |
Correct |
492 ms |
63016 KB |
Output is correct - L = 240026641 |
| 23 |
Correct |
450 ms |
62904 KB |
Output is correct - L = 240026641 |
| 24 |
Correct |
465 ms |
62696 KB |
Output is correct - L = 239026530 |
| 25 |
Correct |
481 ms |
63008 KB |
Output is correct - L = 238026419 |
| 26 |
Correct |
490 ms |
62568 KB |
Output is correct - L = 237026308 |
| 27 |
Correct |
500 ms |
62392 KB |
Output is correct - L = 236026197 |
