oj.uz

Submission #996882

# Submission time Handle Problem Language Result Execution time Memory
996882 2024-06-11T11:44:21 Z AdamGS City (JOI17_city) C++17
71 / 100
 269 ms 39932 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=1596736;
const int LIM=25e4+7;
vector<int>V[LIM];
ll pre[LIM], lpre;
ll rnd(ll x) {
  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;
}
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)*rnd(z);
  Code(x, pre[x]+K*rnd(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=1596736;
void InitDevice() {}
bool oc(ll x, ll y) {
  ll a=x%K, b=y%K, c=x/K;
  return a<=b && b<a+c*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 1 ms 13084 KB Output is correct
2 Correct 2 ms 13084 KB Output is correct
3 Correct 2 ms 13072 KB Output is correct
4 Correct 1 ms 13084 KB Output is correct
5 Correct 2 ms 13084 KB Output is correct
6 Correct 2 ms 13084 KB Output is correct
7 Correct 2 ms 13064 KB Output is correct
8 Correct 1 ms 13080 KB Output is correct
9 Correct 1 ms 13072 KB Output is correct
10 Correct 1 ms 13072 KB Output is correct
11 Correct 2 ms 13084 KB Output is correct
12 Correct 2 ms 13084 KB Output is correct

Subtask #2
63.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 20508 KB Output is correct - L = 75046592
2 Correct 95 ms 20620 KB Output is correct - L = 78240064
3 Correct 96 ms 20644 KB Output is correct - L = 71853120
4 Correct 95 ms 20728 KB Output is correct - L = 67062912
5 Partially correct 223 ms 39160 KB Output is partially correct - L = 1409917888
6 Partially correct 231 ms 39052 KB Output is partially correct - L = 1406724416
7 Partially correct 240 ms 39012 KB Output is partially correct - L = 1414708096
8 Partially correct 269 ms 38828 KB Output is partially correct - L = 1315710464
9 Partially correct 217 ms 39652 KB Output is partially correct - L = 889381952
10 Partially correct 211 ms 39680 KB Output is partially correct - L = 825512512
11 Partially correct 208 ms 39724 KB Output is partially correct - L = 825512512
12 Partially correct 220 ms 39932 KB Output is partially correct - L = 825512512
13 Partially correct 220 ms 39400 KB Output is partially correct - L = 1117715200
14 Partially correct 231 ms 39424 KB Output is partially correct - L = 1282179008
15 Correct 94 ms 20636 KB Output is correct - L = 76643328
16 Correct 97 ms 20640 KB Output is correct - L = 75046592
17 Correct 97 ms 20904 KB Output is correct - L = 76643328
18 Partially correct 223 ms 39424 KB Output is partially correct - L = 1125698880
19 Partially correct 218 ms 39328 KB Output is partially correct - L = 1152843392
20 Partially correct 218 ms 39424 KB Output is partially correct - L = 1154440128
21 Partially correct 222 ms 39424 KB Output is partially correct - L = 1039475136
22 Partially correct 235 ms 39328 KB Output is partially correct - L = 1309323520
23 Partially correct 232 ms 39444 KB Output is partially correct - L = 1309323520
24 Partially correct 229 ms 39080 KB Output is partially correct - L = 1456223232
25 Partially correct 226 ms 39244 KB Output is partially correct - L = 1588752320
26 Partially correct 228 ms 39052 KB Output is partially correct - L = 1714894464
27 Partially correct 227 ms 39052 KB Output is partially correct - L = 1941630976