oj.uz

Submission #996879

# Submission time Handle Problem Language Result Execution time Memory
996879 2024-06-11T11:42:54 Z AdamGS City (JOI17_city) C++17
61 / 100
 287 ms 39940 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=3096736;
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=3096736;
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 1 ms 13072 KB Output is correct
3 Correct 1 ms 13084 KB Output is correct
4 Correct 2 ms 13084 KB Output is correct
5 Correct 1 ms 13084 KB Output is correct
6 Correct 2 ms 13072 KB Output is correct
7 Correct 2 ms 13084 KB Output is correct
8 Correct 2 ms 13080 KB Output is correct
9 Correct 2 ms 13080 KB Output is correct
10 Correct 2 ms 13072 KB Output is correct
11 Correct 1 ms 13072 KB Output is correct
12 Correct 2 ms 13084 KB Output is correct

Subtask #2
53.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 20636 KB Output is correct - L = 145546592
2 Correct 92 ms 20620 KB Output is correct - L = 151740064
3 Correct 119 ms 20640 KB Output is correct - L = 139353120
4 Correct 94 ms 20636 KB Output is correct - L = 130062912
5 Partially correct 231 ms 39052 KB Output is partially correct - L = 2734417888
6 Partially correct 225 ms 39000 KB Output is partially correct - L = 2728224416
7 Partially correct 223 ms 39264 KB Output is partially correct - L = 2743708096
8 Partially correct 218 ms 38716 KB Output is partially correct - L = 2551710464
9 Partially correct 213 ms 39688 KB Output is partially correct - L = 1724881952
10 Partially correct 212 ms 39940 KB Output is partially correct - L = 1601012512
11 Partially correct 220 ms 39932 KB Output is partially correct - L = 1601012512
12 Partially correct 207 ms 39724 KB Output is partially correct - L = 1601012512
13 Partially correct 264 ms 39428 KB Output is partially correct - L = 2167715200
14 Partially correct 222 ms 39272 KB Output is partially correct - L = 2486679008
15 Correct 96 ms 20668 KB Output is correct - L = 148643328
16 Correct 94 ms 20632 KB Output is correct - L = 145546592
17 Correct 95 ms 20636 KB Output is correct - L = 148643328
18 Partially correct 235 ms 39200 KB Output is partially correct - L = 2183198880
19 Partially correct 221 ms 39252 KB Output is partially correct - L = 2235843392
20 Partially correct 223 ms 39432 KB Output is partially correct - L = 2238940128
21 Partially correct 287 ms 39256 KB Output is partially correct - L = 2015975136
22 Partially correct 220 ms 39312 KB Output is partially correct - L = 2539323520
23 Partially correct 258 ms 39084 KB Output is partially correct - L = 2539323520
24 Partially correct 223 ms 39084 KB Output is partially correct - L = 2824223232
25 Partially correct 232 ms 38988 KB Output is partially correct - L = 3081252320
26 Partially correct 225 ms 39048 KB Output is partially correct - L = 3325894464
27 Partially correct 256 ms 38988 KB Output is partially correct - L = 3765630976