oj.uz

Submission #988200

# Submission time Handle Problem Language Result Execution time Memory
988200 2024-05-24T09:51:10 Z GrindMachine City (JOI17_city) C++17
0 / 100
 6 ms 15908 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

// #ifdef LOCAL
// #include "debug.h"
// #else
// #define debug(...) 42
// #endif

/*

refs:
https://ivaniscoding.wordpress.com/2018/08/28/communication-5-city/

*/

const int MOD = 1e9 + 7;
const int N = 3e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Encoder.h"

vector<ll> adj[N];
vector<ll> tin(N), subsiz(N);
static vector<ll> sizes;
ll timer = 0;

void dfs1(ll u, ll p){
    tin[u] = timer++;
    subsiz[u] = 1;

    trav(v,adj[u]){
        if(v == p) conts;
        dfs1(v,u);
        subsiz[u] += subsiz[v];
    }

    auto it = lower_bound(all(sizes),subsiz[u]);
    assert(it != sizes.end());

    while(subsiz[u] < *it){
        subsiz[u]++;
        timer++;
    }
}

void Encode(int n, int A[], int B[])
{
    for (int i = 0; i < N; ++i) {
        Code(i, 0LL);
    }

    rep(i,n-1){
        ll u = A[i], v = B[i];
        adj[u].pb(v), adj[v].pb(u);
    }

    sizes.pb(1);
    ld ratio = 1.08;
    while(true){
        ll nxt = max((ll)(sizes.back()*ratio),sizes.back()+1);
        if(nxt >= (1<<20)) break;
        sizes.pb(nxt);
    }

    sizes.pb((1<<20)-1);

    dfs1(0,-1);
    assert(subsiz[0] <= (1<<20));

    // first 20 bits for tin
    // next 8 bits for subsiz
    rep(i,n){
        ll ind = lower_bound(all(sizes),subsiz[i])-sizes.begin();
        ll val = (tin[i]<<8)+ind;
        Code(i,val);
    }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
https://ivaniscoding.wordpress.com/2018/08/28/communication-5-city/

*/

const int MOD = 1e9 + 7;
const int N = (1<<20) + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Device.h"

static vector<ll> sizes;

void InitDevice()
{
    sizes.pb(1);
    ld ratio = 1.08;
    while(true){
        ll nxt = max((ll)(sizes.back()*ratio),sizes.back()+1);
        if(nxt >= (1<<20)) break;
        sizes.pb(nxt);
    }

    sizes.pb((1<<20)-1);
}

int Answer(long long S, long long T)
{
    auto get = [&](ll x) -> pll{
        ll ti = (x>>8);
        ll ind = x^(ti<<8);
        ll siz = sizes[ind];
        ll tou = ti+siz-1;
        return {ti,tou};
    };

    auto [tin1,tout1] = get(S);
    auto [tin2,tout2] = get(T);
    
    debug(tin1,tout1);
    debug(tin2,tout2);

    if(tin2 <= tin1 and tout2 >= tout1){
        return 0;
    }
    if(tin1 <= tin2 and tout1 >= tout2){
        return 1;
    }	
    return 2;
}

Compilation message

Device.cpp: In function 'int Answer(long long int, long long int)':
Device.cpp:46:20: warning: statement has no effect [-Wunused-value]
   46 | #define debug(...) 42
      |                    ^~
Device.cpp:91:5: note: in expansion of macro 'debug'
   91 |     debug(tin1,tout1);
      |     ^~~~~
Device.cpp:46:20: warning: statement has no effect [-Wunused-value]
   46 | #define debug(...) 42
      |                    ^~
Device.cpp:92:5: note: in expansion of macro 'debug'
   92 |     debug(tin2,tout2);
      |     ^~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 15904 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 15908 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -