oj.uz

Submission #996900

# Submission time Handle Problem Language Result Execution time Memory
996900 2024-06-11T11:58:35 Z AdamGS City (JOI17_city) C++17
97 / 100
 275 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=496736;
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=496736;
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 1 ms 13084 KB Output is correct
2 Correct 2 ms 13068 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 13072 KB Output is correct
6 Correct 2 ms 13080 KB Output is correct
7 Correct 1 ms 13084 KB Output is correct
8 Correct 2 ms 13072 KB Output is correct
9 Correct 1 ms 13084 KB Output is correct
10 Correct 2 ms 13080 KB Output is correct
11 Correct 1 ms 13084 KB Output is correct
12 Correct 2 ms 13072 KB Output is correct

Subtask #2
89.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 20584 KB Output is correct - L = 38248672
2 Correct 97 ms 20528 KB Output is correct - L = 38745408
3 Correct 94 ms 20656 KB Output is correct - L = 39242144
4 Correct 101 ms 20520 KB Output is correct - L = 39242144
5 Partially correct 213 ms 39004 KB Output is partially correct - L = 300028544
6 Partially correct 205 ms 39052 KB Output is partially correct - L = 299531808
7 Partially correct 212 ms 39172 KB Output is partially correct - L = 300028544
8 Partially correct 275 ms 38796 KB Output is partially correct - L = 314433888
9 Partially correct 197 ms 39732 KB Output is partially correct - L = 280159104
10 Partially correct 187 ms 39932 KB Output is partially correct - L = 280655840
11 Partially correct 197 ms 39764 KB Output is partially correct - L = 281649312
12 Partially correct 214 ms 39932 KB Output is partially correct - L = 281649312
13 Partially correct 203 ms 39436 KB Output is partially correct - L = 287610144
14 Partially correct 213 ms 39304 KB Output is partially correct - L = 294564448
15 Correct 99 ms 20636 KB Output is correct - L = 38745408
16 Correct 101 ms 20648 KB Output is correct - L = 39242144
17 Correct 113 ms 20648 KB Output is correct - L = 38745408
18 Partially correct 206 ms 39208 KB Output is partially correct - L = 281152576
19 Partially correct 214 ms 39560 KB Output is partially correct - L = 281152576
20 Partially correct 203 ms 39428 KB Output is partially correct - L = 281152576
21 Partially correct 206 ms 39296 KB Output is partially correct - L = 279662368
22 Partially correct 208 ms 39300 KB Output is partially correct - L = 281152576
23 Partially correct 204 ms 39164 KB Output is partially correct - L = 281152576
24 Partially correct 228 ms 39160 KB Output is partially correct - L = 280655840
25 Partially correct 201 ms 39216 KB Output is partially correct - L = 280159104
26 Partially correct 238 ms 39104 KB Output is partially correct - L = 279662368
27 Partially correct 218 ms 39048 KB Output is partially correct - L = 279662368