oj.uz

Submission #996870

# Submission time Handle Problem Language Result Execution time Memory
996870 2024-06-11T11:15:00 Z AdamGS City (JOI17_city) C++17
56 / 100
 281 ms 53624 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) {
  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=4596736;
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 2 ms 13072 KB Output is correct
2 Correct 2 ms 13088 KB Output is correct
3 Correct 2 ms 13088 KB Output is correct
4 Correct 2 ms 13076 KB Output is correct
5 Correct 2 ms 13072 KB Output is correct
6 Correct 2 ms 13076 KB Output is correct
7 Correct 2 ms 13328 KB Output is correct
8 Correct 2 ms 13076 KB Output is correct
9 Correct 1 ms 13088 KB Output is correct
10 Correct 1 ms 13192 KB Output is correct
11 Correct 1 ms 13076 KB Output is correct
12 Correct 3 ms 13076 KB Output is correct

Subtask #2
48.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 27556 KB Output is correct - L = 216046592
2 Correct 97 ms 27412 KB Output is correct - L = 225240064
3 Correct 98 ms 27704 KB Output is correct - L = 206853120
4 Correct 102 ms 27836 KB Output is correct - L = 193062912
5 Partially correct 231 ms 52640 KB Output is partially correct - L = 4058917888
6 Partially correct 232 ms 52700 KB Output is partially correct - L = 4049724416
7 Partially correct 225 ms 52504 KB Output is partially correct - L = 4072708096
8 Partially correct 242 ms 52192 KB Output is partially correct - L = 3787710464
9 Partially correct 217 ms 53428 KB Output is partially correct - L = 2560381952
10 Partially correct 216 ms 53440 KB Output is partially correct - L = 2376512512
11 Partially correct 217 ms 53624 KB Output is partially correct - L = 2376512512
12 Partially correct 209 ms 53436 KB Output is partially correct - L = 2376512512
13 Partially correct 232 ms 53060 KB Output is partially correct - L = 3217715200
14 Partially correct 226 ms 52800 KB Output is partially correct - L = 3691179008
15 Correct 101 ms 27696 KB Output is correct - L = 220643328
16 Correct 94 ms 27708 KB Output is correct - L = 216046592
17 Correct 98 ms 27668 KB Output is correct - L = 220643328
18 Partially correct 222 ms 52720 KB Output is partially correct - L = 3240698880
19 Partially correct 219 ms 52496 KB Output is partially correct - L = 3318843392
20 Partially correct 237 ms 52776 KB Output is partially correct - L = 3323440128
21 Partially correct 247 ms 52760 KB Output is partially correct - L = 2992475136
22 Partially correct 238 ms 52692 KB Output is partially correct - L = 3769323520
23 Partially correct 230 ms 52620 KB Output is partially correct - L = 3769323520
24 Partially correct 281 ms 52860 KB Output is partially correct - L = 4192223232
25 Partially correct 236 ms 52668 KB Output is partially correct - L = 4573752320
26 Partially correct 267 ms 52696 KB Output is partially correct - L = 4936894464
27 Partially correct 239 ms 52580 KB Output is partially correct - L = 5589630976