oj.uz

답안 #512434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
512434 2022-01-16T11:01:29 Z alextodoran 저장 (Saveit) (IOI10_saveit) C++17
50 / 100
 198 ms 10524 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

static const int N_MAX = 1000;
static const int H_MAX = 36;

static int N, H, E;

static int dist[H_MAX][N_MAX];

static int parent[N_MAX];

static vector <int> adj[N_MAX];

static vector <int> order;

void dfs (int u) {
    order.push_back(u);
    for (int v : adj[u]) {
        if (parent[v] == -1) {
            parent[v] = u;
            dfs(v);
        }
    }
}
void dfs () {
    for (int u = 0; u < N; u++) {
        parent[u] = -1;
    }
    parent[0] = 0;
    dfs(0);
}

#include "grader.h"
#include "encoder.h"

void encode_bit (int bit);

void encode_int (int val, int len) {
    assert(0 <= val && val < (1 << len));
    for (int bit = len - 1; bit >= 0; bit--) {
        encode_bit((val >> bit) & 1);
    }
}

void bfs (int s, int dist[]) {
    for (int u = 0; u < N; u++) {
        dist[u] = -1;
    }
    queue <int> q;
    dist[s] = 0;
    q.push(s);
    while (q.empty() == false) {
        int u = q.front();
        q.pop();
        for (int v : adj[u]) {
            if (dist[v] == -1) {
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }
}

void encode (int nv, int nh, int ne, int *v1, int *v2) {
    N = nv; H = nh; E = ne;
    for (int i = 0; i < E; i++) {
        adj[v1[i]].push_back(v2[i]);
        adj[v2[i]].push_back(v1[i]);
    }
    for (int u = 0; u < N; u++) {
        sort(adj[u].begin(), adj[u].end());
    }
    dfs();
    for (int u = 1; u < N; u++) {
        encode_int(parent[u], 10);
    }
    for (int h = 0; h < H; h++) {
        bfs(h, dist[h]);
        encode_int(dist[h][0], 10);
        for (int i = 1; i < N; i++) {
            int u = order[i];
            assert(-1 <= dist[h][u] - dist[h][parent[u]] && dist[h][u] - dist[h][parent[u]] <= +1);
            encode_int(1 + (dist[h][u] - dist[h][parent[u]]), 2);
        }
    }
    for (int u = 0; u < N; u++) {
        adj[u].clear();
    }
    order.clear();
}
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

static const int N_MAX = 1000;
static const int H_MAX = 36;

static int N, H, E;

static int dist[H_MAX][N_MAX];

static int parent[N_MAX];

static vector <int> adj[N_MAX];

static vector <int> order;

void dfs (int u) {
    order.push_back(u);
    for (int v : adj[u]) {
        if (parent[v] == -1) {
            parent[v] = u;
            dfs(v);
        }
    }
}
void dfs () {
    for (int u = 0; u < N; u++) {
        parent[u] = -1;
    }
    parent[0] = 0;
    dfs(0);
}

#include "grader.h"
#include "decoder.h"

int decode_bit ();

void hops (int a, int b, int d);

int decode_int (int len) {
    int val = 0;
    for (int bit = len - 1; bit >= 0; bit--) {
        val |= (decode_bit() << bit);
    }
    return val;
}

void decode (int nv, int nh) {
    N = nv; H = nh;
    for (int u = 1; u < N; u++) {
        parent[u] = decode_int(10);
        adj[u].push_back(parent[u]);
        adj[parent[u]].push_back(u);
    }
    for (int u = 0; u < N; u++) {
        sort(adj[u].begin(), adj[u].end());
    }
    dfs();
    for (int h = 0; h < H; h++) {
        dist[h][0] = decode_int(10);
        for (int i = 1; i < N; i++) {
            int u = order[i];
            dist[h][u] = dist[h][parent[u]] + (decode_int(2) - 1);
        }
    }
    for (int h = 0; h < H; h++) {
        for (int u = 0; u < N; u++) {
            hops(h, u, dist[h][u]);
        }
    }
    for (int u = 0; u < N; u++) {
        adj[u].clear();
    }
    order.clear();
}

Compilation message

decoder.cpp:18:18: warning: 'E' defined but not used [-Wunused-variable]
   18 | static int N, H, E;
      |                  ^

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 10524 KB Output is partially correct - 82278 call(s) of encode_bit()
2 Correct 3 ms 4580 KB Output is correct - 94 call(s) of encode_bit()
3 Correct 23 ms 5744 KB Output is partially correct - 74078 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 130 call(s) of encode_bit()
5 Correct 25 ms 5988 KB Output is partially correct - 74078 call(s) of encode_bit()
6 Correct 26 ms 6088 KB Output is partially correct - 82278 call(s) of encode_bit()
7 Correct 47 ms 6400 KB Output is partially correct - 82278 call(s) of encode_bit()
8 Correct 22 ms 5712 KB Output is partially correct - 79080 call(s) of encode_bit()
9 Correct 26 ms 5696 KB Output is partially correct - 82278 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is partially correct - 82278 call(s) of encode_bit()
11 Correct 28 ms 5864 KB Output is partially correct - 82278 call(s) of encode_bit()
12 Correct 22 ms 5860 KB Output is partially correct - 82278 call(s) of encode_bit()
13 Correct 48 ms 6384 KB Output is partially correct - 82278 call(s) of encode_bit()
14 Correct 22 ms 5724 KB Output is partially correct - 82278 call(s) of encode_bit()
15 Correct 27 ms 6116 KB Output is partially correct - 82278 call(s) of encode_bit()
16 Correct 53 ms 6152 KB Output is partially correct - 82278 call(s) of encode_bit()
17 Correct 47 ms 6340 KB Output is partially correct - 82278 call(s) of encode_bit()
18 Correct 53 ms 6500 KB Output is partially correct - 82278 call(s) of encode_bit()
19 Correct 38 ms 6160 KB Output is partially correct - 82278 call(s) of encode_bit()
20 Correct 76 ms 6756 KB Output is partially correct - 82278 call(s) of encode_bit()
21 Correct 82 ms 6928 KB Output is partially correct - 82278 call(s) of encode_bit()
22 Correct 52 ms 6352 KB Output is partially correct - 82278 call(s) of encode_bit()
23 Correct 97 ms 7196 KB Output is partially correct - 82278 call(s) of encode_bit()

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 10524 KB Output is partially correct - 82278 call(s) of encode_bit()
2 Correct 3 ms 4580 KB Output is correct - 94 call(s) of encode_bit()
3 Correct 23 ms 5744 KB Output is partially correct - 74078 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 130 call(s) of encode_bit()
5 Correct 25 ms 5988 KB Output is partially correct - 74078 call(s) of encode_bit()
6 Correct 26 ms 6088 KB Output is partially correct - 82278 call(s) of encode_bit()
7 Correct 47 ms 6400 KB Output is partially correct - 82278 call(s) of encode_bit()
8 Correct 22 ms 5712 KB Output is partially correct - 79080 call(s) of encode_bit()
9 Correct 26 ms 5696 KB Output is partially correct - 82278 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is partially correct - 82278 call(s) of encode_bit()
11 Correct 28 ms 5864 KB Output is partially correct - 82278 call(s) of encode_bit()
12 Correct 22 ms 5860 KB Output is partially correct - 82278 call(s) of encode_bit()
13 Correct 48 ms 6384 KB Output is partially correct - 82278 call(s) of encode_bit()
14 Correct 22 ms 5724 KB Output is partially correct - 82278 call(s) of encode_bit()
15 Correct 27 ms 6116 KB Output is partially correct - 82278 call(s) of encode_bit()
16 Correct 53 ms 6152 KB Output is partially correct - 82278 call(s) of encode_bit()
17 Correct 47 ms 6340 KB Output is partially correct - 82278 call(s) of encode_bit()
18 Correct 53 ms 6500 KB Output is partially correct - 82278 call(s) of encode_bit()
19 Correct 38 ms 6160 KB Output is partially correct - 82278 call(s) of encode_bit()
20 Correct 76 ms 6756 KB Output is partially correct - 82278 call(s) of encode_bit()
21 Correct 82 ms 6928 KB Output is partially correct - 82278 call(s) of encode_bit()
22 Correct 52 ms 6352 KB Output is partially correct - 82278 call(s) of encode_bit()
23 Correct 97 ms 7196 KB Output is partially correct - 82278 call(s) of encode_bit()

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 10524 KB Output is partially correct - 82278 call(s) of encode_bit()
2 Correct 3 ms 4580 KB Output is correct - 94 call(s) of encode_bit()
3 Correct 23 ms 5744 KB Output is partially correct - 74078 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 130 call(s) of encode_bit()
5 Correct 25 ms 5988 KB Output is partially correct - 74078 call(s) of encode_bit()
6 Correct 26 ms 6088 KB Output is partially correct - 82278 call(s) of encode_bit()
7 Correct 47 ms 6400 KB Output is partially correct - 82278 call(s) of encode_bit()
8 Correct 22 ms 5712 KB Output is partially correct - 79080 call(s) of encode_bit()
9 Correct 26 ms 5696 KB Output is partially correct - 82278 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is partially correct - 82278 call(s) of encode_bit()
11 Correct 28 ms 5864 KB Output is partially correct - 82278 call(s) of encode_bit()
12 Correct 22 ms 5860 KB Output is partially correct - 82278 call(s) of encode_bit()
13 Correct 48 ms 6384 KB Output is partially correct - 82278 call(s) of encode_bit()
14 Correct 22 ms 5724 KB Output is partially correct - 82278 call(s) of encode_bit()
15 Correct 27 ms 6116 KB Output is partially correct - 82278 call(s) of encode_bit()
16 Correct 53 ms 6152 KB Output is partially correct - 82278 call(s) of encode_bit()
17 Correct 47 ms 6340 KB Output is partially correct - 82278 call(s) of encode_bit()
18 Correct 53 ms 6500 KB Output is partially correct - 82278 call(s) of encode_bit()
19 Correct 38 ms 6160 KB Output is partially correct - 82278 call(s) of encode_bit()
20 Correct 76 ms 6756 KB Output is partially correct - 82278 call(s) of encode_bit()
21 Correct 82 ms 6928 KB Output is partially correct - 82278 call(s) of encode_bit()
22 Correct 52 ms 6352 KB Output is partially correct - 82278 call(s) of encode_bit()
23 Correct 97 ms 7196 KB Output is partially correct - 82278 call(s) of encode_bit()

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 198 ms 10524 KB Output is partially correct - 82278 call(s) of encode_bit()
2 Correct 3 ms 4580 KB Output is correct - 94 call(s) of encode_bit()
3 Correct 23 ms 5744 KB Output is partially correct - 74078 call(s) of encode_bit()
4 Correct 2 ms 4580 KB Output is correct - 130 call(s) of encode_bit()
5 Correct 25 ms 5988 KB Output is partially correct - 74078 call(s) of encode_bit()
6 Correct 26 ms 6088 KB Output is partially correct - 82278 call(s) of encode_bit()
7 Correct 47 ms 6400 KB Output is partially correct - 82278 call(s) of encode_bit()
8 Correct 22 ms 5712 KB Output is partially correct - 79080 call(s) of encode_bit()
9 Correct 26 ms 5696 KB Output is partially correct - 82278 call(s) of encode_bit()
10 Correct 23 ms 5812 KB Output is partially correct - 82278 call(s) of encode_bit()
11 Correct 28 ms 5864 KB Output is partially correct - 82278 call(s) of encode_bit()
12 Correct 22 ms 5860 KB Output is partially correct - 82278 call(s) of encode_bit()
13 Correct 48 ms 6384 KB Output is partially correct - 82278 call(s) of encode_bit()
14 Correct 22 ms 5724 KB Output is partially correct - 82278 call(s) of encode_bit()
15 Correct 27 ms 6116 KB Output is partially correct - 82278 call(s) of encode_bit()
16 Correct 53 ms 6152 KB Output is partially correct - 82278 call(s) of encode_bit()
17 Correct 47 ms 6340 KB Output is partially correct - 82278 call(s) of encode_bit()
18 Correct 53 ms 6500 KB Output is partially correct - 82278 call(s) of encode_bit()
19 Correct 38 ms 6160 KB Output is partially correct - 82278 call(s) of encode_bit()
20 Correct 76 ms 6756 KB Output is partially correct - 82278 call(s) of encode_bit()
21 Correct 82 ms 6928 KB Output is partially correct - 82278 call(s) of encode_bit()
22 Correct 52 ms 6352 KB Output is partially correct - 82278 call(s) of encode_bit()
23 Correct 97 ms 7196 KB Output is partially correct - 82278 call(s) of encode_bit()