oj.uz

Submission #996887

# Submission time Handle Problem Language Result Execution time Memory
996887 2024-06-11T11:46:44 Z AdamGS City (JOI17_city) C++17
8 / 100
 271 ms 39928 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=1196736;
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=1196736;
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 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 2 ms 13080 KB Output is correct
5 Correct 2 ms 13072 KB Output is correct
6 Correct 1 ms 13072 KB Output is correct
7 Correct 1 ms 13084 KB Output is correct
8 Correct 2 ms 13084 KB Output is correct
9 Correct 1 ms 13084 KB Output is correct
10 Correct 1 ms 13084 KB Output is correct
11 Correct 1 ms 13084 KB Output is correct
12 Correct 1 ms 13080 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 20632 KB Output is correct - L = 56246592
2 Correct 111 ms 21036 KB Output is correct - L = 58640064
3 Correct 95 ms 20636 KB Output is correct - L = 53853120
4 Correct 98 ms 20636 KB Output is correct - L = 50262912
5 Partially correct 239 ms 38988 KB Output is partially correct - L = 1056717888
6 Partially correct 237 ms 39304 KB Output is partially correct - L = 1054324416
7 Partially correct 233 ms 38996 KB Output is partially correct - L = 1060308096
8 Partially correct 244 ms 38684 KB Output is partially correct - L = 986110464
9 Partially correct 271 ms 39680 KB Output is partially correct - L = 666581952
10 Partially correct 219 ms 39708 KB Output is partially correct - L = 618712512
11 Partially correct 210 ms 39772 KB Output is partially correct - L = 618712512
12 Partially correct 216 ms 39928 KB Output is partially correct - L = 618712512
13 Partially correct 235 ms 39376 KB Output is partially correct - L = 837715200
14 Partially correct 254 ms 39304 KB Output is partially correct - L = 960979008
15 Correct 103 ms 20636 KB Output is correct - L = 57443328
16 Correct 99 ms 20632 KB Output is correct - L = 56246592
17 Correct 115 ms 20728 KB Output is correct - L = 57443328
18 Partially correct 212 ms 39364 KB Output is partially correct - L = 843698880
19 Partially correct 228 ms 39432 KB Output is partially correct - L = 864043392
20 Partially correct 225 ms 39428 KB Output is partially correct - L = 865240128
21 Partially correct 253 ms 39256 KB Output is partially correct - L = 779075136
22 Partially correct 224 ms 39300 KB Output is partially correct - L = 981323520
23 Partially correct 240 ms 39080 KB Output is partially correct - L = 981323520
24 Partially correct 226 ms 39308 KB Output is partially correct - L = 1091423232
25 Partially correct 229 ms 39120 KB Output is partially correct - L = 1190752320
26 Partially correct 232 ms 39028 KB Output is partially correct - L = 1285294464
27 Incorrect 264 ms 38992 KB Wrong Answer [6]
28 Halted 0 ms 0 KB -