oj.uz

Submission #996895

# Submission time Handle Problem Language Result Execution time Memory
996895 2024-06-11T11:54:50 Z AdamGS City (JOI17_city) C++17
64 / 100
 251 ms 39948 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=4596736;
const int LIM=25e4+7;
vector<int>V[LIM];
ll pre[LIM], lpre;
ll rnd(ll x) {
  if(x<=100) return x;
  x-=100;
  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+100;
}
ll cod(ll x) {
  if(x<=100) return x;
  x-=100;
  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+100;
}
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=4596736;
void InitDevice() {}
ll dec(ll x) {
  if(x<=100) return x;
  x-=100;
  return x*x+100;
}
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 2 ms 13084 KB Output is correct
2 Correct 1 ms 13068 KB Output is correct
3 Correct 1 ms 13084 KB Output is correct
4 Correct 2 ms 13072 KB Output is correct
5 Correct 2 ms 13068 KB Output is correct
6 Correct 2 ms 13068 KB Output is correct
7 Correct 2 ms 13172 KB Output is correct
8 Correct 2 ms 13084 KB Output is correct
9 Correct 2 ms 13084 KB Output is correct
10 Correct 1 ms 13072 KB Output is correct
11 Correct 2 ms 13072 KB Output is correct
12 Correct 1 ms 13084 KB Output is correct

Subtask #2
56.0 / 92.0

# Verdict Execution time Memory Grader output
1 Partially correct 93 ms 20536 KB Output is partially correct - L = 579188736
2 Partially correct 115 ms 20724 KB Output is partially correct - L = 579188736
3 Partially correct 95 ms 20592 KB Output is partially correct - L = 579188736
4 Partially correct 96 ms 20672 KB Output is partially correct - L = 583785472
5 Partially correct 234 ms 39052 KB Output is partially correct - L = 2928120832
6 Partially correct 202 ms 39064 KB Output is partially correct - L = 2928120832
7 Partially correct 226 ms 39052 KB Output is partially correct - L = 2928120832
8 Partially correct 213 ms 38920 KB Output is partially correct - L = 3139570688
9 Partially correct 232 ms 39748 KB Output is partially correct - L = 2813202432
10 Partially correct 199 ms 39740 KB Output is partially correct - L = 2826992640
11 Partially correct 193 ms 39932 KB Output is partially correct - L = 2836186112
12 Partially correct 192 ms 39948 KB Output is partially correct - L = 2836186112
13 Partially correct 206 ms 39428 KB Output is partially correct - L = 2872960000
14 Partially correct 251 ms 39272 KB Output is partially correct - L = 2909733888
15 Partially correct 99 ms 20604 KB Output is partially correct - L = 583785472
16 Partially correct 102 ms 20640 KB Output is partially correct - L = 583785472
17 Partially correct 91 ms 20648 KB Output is partially correct - L = 579188736
18 Partially correct 242 ms 39288 KB Output is partially correct - L = 2831589376
19 Partially correct 191 ms 39424 KB Output is partially correct - L = 2831589376
20 Partially correct 221 ms 39392 KB Output is partially correct - L = 2831589376
21 Partially correct 212 ms 39360 KB Output is partially correct - L = 2813202432
22 Partially correct 204 ms 39300 KB Output is partially correct - L = 2831589376
23 Partially correct 211 ms 39384 KB Output is partially correct - L = 2831589376
24 Partially correct 206 ms 39308 KB Output is partially correct - L = 2826992640
25 Partially correct 209 ms 39312 KB Output is partially correct - L = 2822395904
26 Partially correct 210 ms 38992 KB Output is partially correct - L = 2817799168
27 Partially correct 216 ms 39052 KB Output is partially correct - L = 2817799168