oj.uz

Submission #996902

# Submission time Handle Problem Language Result Execution time Memory
996902 2024-06-11T11:59:27 Z AdamGS City (JOI17_city) C++17
100 / 100
 257 ms 39936 KB 
#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll K=396736;
const int LIM=25e4+7;
vector<int>V[LIM];
ll pre[LIM], lpre;
ll rnd(ll x) {
  if(x<=50) return x;
  x-=50;
  ll po=0, ko=1000000000;
  while(po<ko) {
    ll sr=(po+ko)/2;
    if(sr*sr<x) po=sr+1; else ko=sr;
  }
  return po*po+50;
}
ll cod(ll x) {
  if(x<=50) return x;
  x-=50;
  ll po=0, ko=1000000000;
  while(po<ko) {
    ll sr=(po+ko)/2;
    if(sr*sr<x) po=sr+1; else ko=sr;
  }
  return po+50;
}
void DFS(int x, int o) {
  pre[x]=lpre; ++lpre;
  for(auto i : V[x]) if(i!=o) DFS(i, x);
  ll z=lpre-pre[x];
  lpre=pre[x]+rnd(z);
  Code(x, pre[x]+K*cod(z));
}
void Encode(int n, int A[], int B[]) {
  rep(i, n-1) {
    V[A[i]].pb(B[i]);
    V[B[i]].pb(A[i]);
  }
  DFS(0, 0);
}
#include "Device.h"
#include<bits/stdc++.h>
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll K=396736;
void InitDevice() {}
ll dec(ll x) {
  if(x<=50) return x;
  x-=50;
  return x*x+50;
}
bool oc(ll x, ll y) {
  ll a=x%K, b=y%K, c=x/K;
  return a<=b && b<a+dec(c);
}
int Answer(ll S, ll T) {
  if(oc(S, T)) return 1;
  if(oc(T, S)) return 0;
  return 2;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13084 KB Output is correct
2 Correct 1 ms 13072 KB Output is correct
3 Correct 2 ms 13072 KB Output is correct
4 Correct 1 ms 13072 KB Output is correct
5 Correct 1 ms 13072 KB Output is correct
6 Correct 1 ms 13072 KB Output is correct
7 Correct 1 ms 13072 KB Output is correct
8 Correct 2 ms 13336 KB Output is correct
9 Correct 2 ms 13068 KB Output is correct
10 Correct 2 ms 13072 KB Output is correct
11 Correct 2 ms 13084 KB Output is correct
12 Correct 2 ms 13088 KB Output is correct

Subtask #2
92.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 20636 KB Output is correct - L = 30548672
2 Correct 93 ms 20552 KB Output is correct - L = 30945408
3 Correct 94 ms 20640 KB Output is correct - L = 31342144
4 Correct 122 ms 20632 KB Output is correct - L = 31342144
5 Correct 210 ms 39052 KB Output is correct - L = 239628544
6 Correct 205 ms 38996 KB Output is correct - L = 239231808
7 Correct 206 ms 39032 KB Output is correct - L = 239628544
8 Correct 214 ms 38868 KB Output is correct - L = 251133888
9 Correct 197 ms 39680 KB Output is correct - L = 223759104
10 Correct 213 ms 39936 KB Output is correct - L = 224155840
11 Correct 193 ms 39876 KB Output is correct - L = 224949312
12 Correct 199 ms 39928 KB Output is correct - L = 224949312
13 Correct 199 ms 39324 KB Output is correct - L = 229710144
14 Correct 203 ms 39184 KB Output is correct - L = 235264448
15 Correct 99 ms 20716 KB Output is correct - L = 30945408
16 Correct 96 ms 20640 KB Output is correct - L = 31342144
17 Correct 95 ms 20552 KB Output is correct - L = 30945408
18 Correct 211 ms 39260 KB Output is correct - L = 224552576
19 Correct 209 ms 39344 KB Output is correct - L = 224552576
20 Correct 209 ms 39220 KB Output is correct - L = 224552576
21 Correct 257 ms 39348 KB Output is correct - L = 223362368
22 Correct 219 ms 39504 KB Output is correct - L = 224552576
23 Correct 205 ms 39352 KB Output is correct - L = 224552576
24 Correct 209 ms 39312 KB Output is correct - L = 224155840
25 Correct 209 ms 39076 KB Output is correct - L = 223759104
26 Correct 213 ms 39200 KB Output is correct - L = 223362368
27 Correct 218 ms 39140 KB Output is correct - L = 223362368