oj.uz

Submission #1090743

# Submission time Handle Problem Language Result Execution time Memory
1090743 2024-09-18T16:17:40 Z Tymond Saveit (IOI10_saveit) C++17
50 / 100
 155 ms 10776 KB 
#include "grader.h"
#include "encoder.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 1e3 + 7;
const int MAXH = 40;
int dist[MAXH][MAXN];
int rep[MAXN];
int parent[MAXN];
vi g[MAXN];
vi gt[MAXN];
int n, h, m;

int Find(int a){
    if(a == rep[a]){
        return a;
    }
    return rep[a] = Find(rep[a]);
}

void Union(int a, int b){
    rep[Find(a)] = Find(b);
}

void dfs(int v, int p){
    parent[v] = p;
    for(auto u : g[v]){
        if(u == p){
            continue;
        }
        dfs(u, v);
    }
}

void countDist(int start){
    dist[start][start] = 0;
    queue<int> q;
    q.push(start);
    while(sz(q)){
        int v = q.front();
        q.pop();
 
        for(auto u : gt[v]){
            if(u == start){
                continue;
            }
            if(dist[start][u] == 0){
                dist[start][u] = dist[start][v] + 1;
                q.push(u);
            }
        }
    }
}

void encode(int nv, int nh, int ne, int *v1, int *v2){
    n = nv;
    h = nh;
    m = ne;
    for(int i = 0; i < n; i++){
        rep[i] = i;
    }
    for(int i = 0; i < m; i++){
        if(Find(v1[i]) != Find(v2[i])){
            g[v1[i]].pb(v2[i]);
            g[v2[i]].pb(v1[i]);
            Union(v1[i], v2[i]);
        }
        gt[v1[i]].pb(v2[i]);
        gt[v2[i]].pb(v1[i]);
    }

    for(int i = 0; i < n; i++){
        sort(all(g[i]));
    }

    dfs(0, 0);
    for(int i = 1; i < n; i++){
        for(int y = 0; y < 10; y++){
            if(parent[i] & (1 << y)){
                encode_bit(1);
            }else{
                encode_bit(0);
            }
        }
    }

    for(int i = 0; i < h; i++){
        countDist(i);
    }

    for(int i = 0; i < h; i++){
        queue<int> q;
        vi vis(n, 0);
        q.push(i);
        while(sz(q)){
            int v = q.front();
            q.pop();
            vis[v] = 1;
            for(auto u : g[v]){
                if(vis[u]){
                    continue;
                }
                if(dist[i][u] == dist[i][v]){
                    encode_bit(0);
                    encode_bit(0);
                }else if(dist[i][u] == dist[i][v] + 1){
                    encode_bit(0);
                    encode_bit(1);
                }else{
                    encode_bit(1);
                    encode_bit(1);
                }
                q.push(u);
            }
        }
    }

    return;
}
#include "grader.h"
#include "decoder.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 1e3 + 7;
const int MAXH = 40;
int dist[MAXH][MAXN];
int parent[MAXN];
vi g[MAXN];
int n, h;

void countDist(int start){
    dist[start][start] = 0;
    queue<int> q;
    q.push(start);
    while(sz(q)){
        int v = q.front();
        q.pop();
 
        for(auto u : g[v]){
            if(u == start){
                continue;
            }
            if(dist[start][u] == 0){
                dist[start][u] = dist[start][v] + 1;
                q.push(u);
            }
        }
    }
}

void decode(int nv, int nh) {
    n = nv;
    h = nh;

    for(int i = 1; i < n; i++){
        for(int y = 0; y < 10; y++){
            if(decode_bit()){
                parent[i] += (1 << y);
            }
        }
        g[i].pb(parent[i]);
        g[parent[i]].pb(i);
    }

    for(int i = 0; i < n; i++){
        sort(all(g[i]));
    }

    for(int i = 0; i < h; i++){
        countDist(i);
    }

    for(int i = 0; i < h; i++){
        queue<int> q;
        vi vis(n, 0);
        q.push(i);
        while(sz(q)){
            int v = q.front();
            q.pop();
            vis[v] = 1;
            for(auto u : g[v]){
                if(vis[u]){
                    continue;
                }
                int x = decode_bit();
                int y = decode_bit();
                if(x == 0 && y == 0){
                    dist[i][u] = dist[i][v];
                }else if(x == 0 && y == 1){
                    dist[i][u] = dist[i][v] + 1;
                }else{
                    dist[i][u] = dist[i][v] - 1;
                }
                q.push(u);
            }
        }

        for(int j = 0; j < n; j++){
            hops(i, j, dist[i][j]);
        }
    }

    return;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 10776 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 2 ms 4624 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5936 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 4 ms 4624 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 26 ms 5948 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 19 ms 6152 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 31 ms 6308 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 18 ms 5984 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 31 ms 6016 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 25 ms 6064 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 19 ms 6164 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 26 ms 6072 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 40 ms 6716 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 29 ms 5908 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 27 ms 5972 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 37 ms 6564 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 34 ms 6488 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 43 ms 6568 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 27 ms 6140 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 49 ms 7048 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 55 ms 7080 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 39 ms 6576 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 63 ms 7312 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 10776 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 2 ms 4624 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5936 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 4 ms 4624 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 26 ms 5948 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 19 ms 6152 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 31 ms 6308 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 18 ms 5984 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 31 ms 6016 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 25 ms 6064 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 19 ms 6164 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 26 ms 6072 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 40 ms 6716 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 29 ms 5908 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 27 ms 5972 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 37 ms 6564 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 34 ms 6488 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 43 ms 6568 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 27 ms 6140 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 49 ms 7048 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 55 ms 7080 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 39 ms 6576 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 63 ms 7312 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 10776 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 2 ms 4624 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5936 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 4 ms 4624 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 26 ms 5948 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 19 ms 6152 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 31 ms 6308 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 18 ms 5984 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 31 ms 6016 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 25 ms 6064 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 19 ms 6164 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 26 ms 6072 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 40 ms 6716 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 29 ms 5908 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 27 ms 5972 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 37 ms 6564 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 34 ms 6488 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 43 ms 6568 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 27 ms 6140 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 49 ms 7048 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 55 ms 7080 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 39 ms 6576 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 63 ms 7312 KB Output is partially correct - 81918 call(s) of encode_bit()

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 10776 KB Output is partially correct - 81918 call(s) of encode_bit()
2 Correct 2 ms 4624 KB Output is correct - 64 call(s) of encode_bit()
3 Correct 28 ms 5936 KB Output is partially correct - 73718 call(s) of encode_bit()
4 Correct 4 ms 4624 KB Output is correct - 80 call(s) of encode_bit()
5 Correct 26 ms 5948 KB Output is partially correct - 73718 call(s) of encode_bit()
6 Correct 19 ms 6152 KB Output is partially correct - 81918 call(s) of encode_bit()
7 Correct 31 ms 6308 KB Output is partially correct - 81918 call(s) of encode_bit()
8 Correct 18 ms 5984 KB Output is partially correct - 78720 call(s) of encode_bit()
9 Correct 31 ms 6016 KB Output is partially correct - 81918 call(s) of encode_bit()
10 Correct 25 ms 6064 KB Output is partially correct - 81918 call(s) of encode_bit()
11 Correct 19 ms 6164 KB Output is partially correct - 81918 call(s) of encode_bit()
12 Correct 26 ms 6072 KB Output is partially correct - 81918 call(s) of encode_bit()
13 Correct 40 ms 6716 KB Output is partially correct - 81918 call(s) of encode_bit()
14 Correct 29 ms 5908 KB Output is partially correct - 81918 call(s) of encode_bit()
15 Correct 27 ms 5972 KB Output is partially correct - 81918 call(s) of encode_bit()
16 Correct 37 ms 6564 KB Output is partially correct - 81918 call(s) of encode_bit()
17 Correct 34 ms 6488 KB Output is partially correct - 81918 call(s) of encode_bit()
18 Correct 43 ms 6568 KB Output is partially correct - 81918 call(s) of encode_bit()
19 Correct 27 ms 6140 KB Output is partially correct - 81918 call(s) of encode_bit()
20 Correct 49 ms 7048 KB Output is partially correct - 81918 call(s) of encode_bit()
21 Correct 55 ms 7080 KB Output is partially correct - 81918 call(s) of encode_bit()
22 Correct 39 ms 6576 KB Output is partially correct - 81918 call(s) of encode_bit()
23 Correct 63 ms 7312 KB Output is partially correct - 81918 call(s) of encode_bit()