oj.uz

답안 #1090133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090133 2024-09-17T19:11:56 Z Tymond 저장 (Saveit) (IOI10_saveit) C++17
0 / 100
 169 ms 12896 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];
vi g[MAXN];
int n, h, m;

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 encode(int nv, int nh, int ne, int *v1, int *v2){
    n = nv;
    h = nh;
    m = ne;
    for(int i = 0; i < m; i++){
        g[v1[i]].pb(v2[i]);
        g[v2[i]].pb(v1[i]);
    }

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

    for(int i = 0; i < h; i++){
        for(int j = 0; j < n; j++){
            for(int y = 0; y < 10; y++){
                if(dist[i][j] & (1 << y)){
                    encode_bit(1);
                }else{
                    encode_bit(0);
                }
            }
        }
    }
    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 n, h;

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

    for(int i = 0; i < h; i++){
        for(int j = 0; j < n; j++){
            for(int y = 0; y < 10; y++){
                int a = decode_bit();
                dist[i][j] += (a * (1 << y));
            }
            hops(i, j, dist[j][i]);
        }
    }
    return;
}

Subtask #1
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 169 ms 12896 KB wrong parameter
2 Incorrect 1 ms 4620 KB Output isn't correct
3 Incorrect 51 ms 7608 KB wrong parameter
4 Incorrect 2 ms 4624 KB Output isn't correct
5 Incorrect 65 ms 7676 KB wrong parameter
6 Incorrect 39 ms 8080 KB wrong parameter
7 Incorrect 50 ms 8320 KB wrong parameter
8 Incorrect 39 ms 7640 KB wrong parameter
9 Incorrect 47 ms 7784 KB wrong parameter
10 Incorrect 49 ms 7732 KB wrong parameter
11 Incorrect 44 ms 7964 KB wrong parameter
12 Incorrect 62 ms 7912 KB wrong parameter
13 Incorrect 62 ms 8620 KB wrong parameter
14 Incorrect 55 ms 7932 KB wrong parameter
15 Incorrect 44 ms 7904 KB wrong parameter
16 Incorrect 65 ms 8368 KB wrong parameter
17 Incorrect 53 ms 8448 KB wrong parameter
18 Incorrect 79 ms 8644 KB wrong parameter
19 Incorrect 61 ms 8240 KB wrong parameter
20 Incorrect 66 ms 8680 KB wrong parameter
21 Incorrect 69 ms 9120 KB wrong parameter
22 Incorrect 67 ms 8428 KB wrong parameter
23 Incorrect 74 ms 9224 KB wrong parameter

Subtask #2
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 169 ms 12896 KB wrong parameter
2 Incorrect 1 ms 4620 KB Output isn't correct
3 Incorrect 51 ms 7608 KB wrong parameter
4 Incorrect 2 ms 4624 KB Output isn't correct
5 Incorrect 65 ms 7676 KB wrong parameter
6 Incorrect 39 ms 8080 KB wrong parameter
7 Incorrect 50 ms 8320 KB wrong parameter
8 Incorrect 39 ms 7640 KB wrong parameter
9 Incorrect 47 ms 7784 KB wrong parameter
10 Incorrect 49 ms 7732 KB wrong parameter
11 Incorrect 44 ms 7964 KB wrong parameter
12 Incorrect 62 ms 7912 KB wrong parameter
13 Incorrect 62 ms 8620 KB wrong parameter
14 Incorrect 55 ms 7932 KB wrong parameter
15 Incorrect 44 ms 7904 KB wrong parameter
16 Incorrect 65 ms 8368 KB wrong parameter
17 Incorrect 53 ms 8448 KB wrong parameter
18 Incorrect 79 ms 8644 KB wrong parameter
19 Incorrect 61 ms 8240 KB wrong parameter
20 Incorrect 66 ms 8680 KB wrong parameter
21 Incorrect 69 ms 9120 KB wrong parameter
22 Incorrect 67 ms 8428 KB wrong parameter
23 Incorrect 74 ms 9224 KB wrong parameter

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 169 ms 12896 KB wrong parameter
2 Incorrect 1 ms 4620 KB Output isn't correct
3 Incorrect 51 ms 7608 KB wrong parameter
4 Incorrect 2 ms 4624 KB Output isn't correct
5 Incorrect 65 ms 7676 KB wrong parameter
6 Incorrect 39 ms 8080 KB wrong parameter
7 Incorrect 50 ms 8320 KB wrong parameter
8 Incorrect 39 ms 7640 KB wrong parameter
9 Incorrect 47 ms 7784 KB wrong parameter
10 Incorrect 49 ms 7732 KB wrong parameter
11 Incorrect 44 ms 7964 KB wrong parameter
12 Incorrect 62 ms 7912 KB wrong parameter
13 Incorrect 62 ms 8620 KB wrong parameter
14 Incorrect 55 ms 7932 KB wrong parameter
15 Incorrect 44 ms 7904 KB wrong parameter
16 Incorrect 65 ms 8368 KB wrong parameter
17 Incorrect 53 ms 8448 KB wrong parameter
18 Incorrect 79 ms 8644 KB wrong parameter
19 Incorrect 61 ms 8240 KB wrong parameter
20 Incorrect 66 ms 8680 KB wrong parameter
21 Incorrect 69 ms 9120 KB wrong parameter
22 Incorrect 67 ms 8428 KB wrong parameter
23 Incorrect 74 ms 9224 KB wrong parameter

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 169 ms 12896 KB wrong parameter
2 Incorrect 1 ms 4620 KB Output isn't correct
3 Incorrect 51 ms 7608 KB wrong parameter
4 Incorrect 2 ms 4624 KB Output isn't correct
5 Incorrect 65 ms 7676 KB wrong parameter
6 Incorrect 39 ms 8080 KB wrong parameter
7 Incorrect 50 ms 8320 KB wrong parameter
8 Incorrect 39 ms 7640 KB wrong parameter
9 Incorrect 47 ms 7784 KB wrong parameter
10 Incorrect 49 ms 7732 KB wrong parameter
11 Incorrect 44 ms 7964 KB wrong parameter
12 Incorrect 62 ms 7912 KB wrong parameter
13 Incorrect 62 ms 8620 KB wrong parameter
14 Incorrect 55 ms 7932 KB wrong parameter
15 Incorrect 44 ms 7904 KB wrong parameter
16 Incorrect 65 ms 8368 KB wrong parameter
17 Incorrect 53 ms 8448 KB wrong parameter
18 Incorrect 79 ms 8644 KB wrong parameter
19 Incorrect 61 ms 8240 KB wrong parameter
20 Incorrect 66 ms 8680 KB wrong parameter
21 Incorrect 69 ms 9120 KB wrong parameter
22 Incorrect 67 ms 8428 KB wrong parameter
23 Incorrect 74 ms 9224 KB wrong parameter