oj.uz

Submission #996885

# Submission time Handle Problem Language Result Execution time Memory
996885 2024-06-11T11:45:59 Z AdamGS City (JOI17_city) C++17
74 / 100
 244 ms 39916 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=1296736;
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=1296736;
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 13072 KB Output is correct
3 Correct 2 ms 13072 KB Output is correct
4 Correct 2 ms 13072 KB Output is correct
5 Correct 1 ms 13080 KB Output is correct
6 Correct 1 ms 13084 KB Output is correct
7 Correct 2 ms 13080 KB Output is correct
8 Correct 2 ms 13084 KB Output is correct
9 Correct 2 ms 13068 KB Output is correct
10 Correct 2 ms 13068 KB Output is correct
11 Correct 2 ms 13072 KB Output is correct
12 Correct 1 ms 13072 KB Output is correct

Subtask #2
66.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 20900 KB Output is correct - L = 60946592
2 Correct 94 ms 20520 KB Output is correct - L = 63540064
3 Correct 104 ms 20636 KB Output is correct - L = 58353120
4 Correct 94 ms 20940 KB Output is correct - L = 54462912
5 Partially correct 222 ms 39016 KB Output is partially correct - L = 1145017888
6 Partially correct 223 ms 39048 KB Output is partially correct - L = 1142424416
7 Partially correct 221 ms 39008 KB Output is partially correct - L = 1148908096
8 Partially correct 222 ms 38792 KB Output is partially correct - L = 1068510464
9 Partially correct 207 ms 39680 KB Output is partially correct - L = 722281952
10 Partially correct 244 ms 39780 KB Output is partially correct - L = 670412512
11 Partially correct 204 ms 39824 KB Output is partially correct - L = 670412512
12 Partially correct 207 ms 39916 KB Output is partially correct - L = 670412512
13 Partially correct 219 ms 39620 KB Output is partially correct - L = 907715200
14 Partially correct 223 ms 39212 KB Output is partially correct - L = 1041279008
15 Correct 93 ms 20636 KB Output is correct - L = 62243328
16 Correct 92 ms 20624 KB Output is correct - L = 60946592
17 Correct 93 ms 20648 KB Output is correct - L = 62243328
18 Partially correct 219 ms 39356 KB Output is partially correct - L = 914198880
19 Partially correct 227 ms 39420 KB Output is partially correct - L = 936243392
20 Partially correct 220 ms 39428 KB Output is partially correct - L = 937540128
21 Partially correct 215 ms 39428 KB Output is partially correct - L = 844175136
22 Partially correct 237 ms 39300 KB Output is partially correct - L = 1063323520
23 Partially correct 223 ms 39136 KB Output is partially correct - L = 1063323520
24 Partially correct 223 ms 39172 KB Output is partially correct - L = 1182623232
25 Partially correct 222 ms 38988 KB Output is partially correct - L = 1290252320
26 Partially correct 232 ms 39048 KB Output is partially correct - L = 1392694464
27 Partially correct 226 ms 39072 KB Output is partially correct - L = 1576830976