oj.uz

답안 #566652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
566652 2022-05-22T14:14:38 Z RealSnake 저장 (Saveit) (IOI10_saveit) C++14
75 / 100
 214 ms 16260 KB 
#include "bits/stdc++.h"
using namespace std;
#include "grader.h"
#include "encoder.h"

void encode(int n, int h, int p, int a[], int b[]) {
    vector<int> v[n];
    for(int i = 0; i < p; i++) {
        v[a[i]].push_back(b[i]);
        v[b[i]].push_back(a[i]);
    }
    set<pair<int, int>> s;
    s.insert({0, 0});
    int par[n] = {};
    par[0] = 1;
    vector<int> v2[n];
    while(s.size()) {
        pair<int, int> p = *s.begin();
        s.erase(s.begin());
        int x = p.second;
        int dis = p.first;
        for(int i : v[x]) {
            if(!par[i]) {
                v2[x].push_back(i);
                v2[i].push_back(x);
                par[i] = x + 1;
                s.insert({dis + 1, i});
            }
        }
    }
    for(int i = 0; i < n; i++)
        sort(v2[i].begin(), v2[i].end());
    for(int i = 1; i < n; i++) {
        int x = par[i] - 1;
        for(int j = 0; j < 10; j++)
            encode_bit(((x & (1 << j)) > 0));
    }
    int ans[n][h];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < h; j++)
            ans[i][j] = 1e9;
    }
    set<pair<int, pair<int, int>>> ss;
    for(int i = 0; i < h; i++) {
        ss.insert({0, {i, i}});
        ans[i][i] = 0;
    }
    while(ss.size()) {
        pair<int, pair<int, int>> p = *ss.begin();
        ss.erase(ss.begin());
        int x = p.second.first, hub = p.second.second;
        int cost = p.first;
        if(cost > ans[x][hub])
            continue;
        for(int i : v[x]) {
            if(cost + 1 < ans[i][hub]) {
                ans[i][hub] = cost + 1;
                ss.insert({cost + 1, {i, hub}});
            }
        }
    }
    bool vis[n];
    for(int i = 1; i < h; i++) {
        for(int j = 0; j < n; j++)
            vis[j] = 0;
        set<int> s;
        s.insert(i);
        vis[i] = 1;
        while(s.size()) {
            int x = *s.begin();
            s.erase(s.begin());
            for(int j : v2[x]) {
                if(vis[j])
                    continue;
                vis[j] = 1;
                s.insert(j);
                if(j <= i)
                    continue;
                int dif = ans[j][i] - ans[x][i];
                if(dif == 0)
                    encode_bit(0);
                else {
                    encode_bit(1);
                    if(dif == 1)
                        encode_bit(1);
                    else
                        encode_bit(0);
                }
            }
        }
    }
}
#include "bits/stdc++.h"
using namespace std;
#include "grader.h"
#include "decoder.h"

void decode(int n, int h) {
    vector<int> v[n];
    for(int i = 1; i < n; i++) {
        int x = 0;
        for(int j = 0; j < 10; j++) {
            if(decode_bit())
                x += (1 << j);
        }
        v[x].push_back(i);
        v[i].push_back(x);
    }
    for(int i = 0; i < n; i++)
        sort(v[i].begin(), v[i].end());
    int ans[n][n];
    bool vis[n] = {};
    set<pair<int, int>> ss;
    ss.insert({0, 0});
    ans[0][0] = 0;
    vis[0] = 1;
    while(ss.size()) {
        pair<int, int> p = *ss.begin();
        ss.erase(ss.begin());
        int x = p.second;
        int dis = p.first;
        hops(0, x, ans[x][0]);
        if(x < h && x != 0)
            hops(x, 0, ans[x][0]);
        for(int i : v[x]) {
            if(vis[i])
                continue;
            vis[i] = 1;
            ans[i][0] = ans[0][i] = ans[x][0] + 1;
            ss.insert({dis + 1, i});
        }
    }
    for(int i = 1; i < h; i++) {
        for(int j = 0; j < n; j++)
            vis[j] = 0;
        ans[i][i] = 0;
        set<int> s;
        s.insert(i);
        vis[i] = 1;
        while(s.size()) {
            int x = *s.begin();
            s.erase(s.begin());
            if(x >= i) {
                hops(i, x, ans[x][i]);
                if(x < h && x != i)
                    hops(x, i, ans[x][i]);
            }
            for(int j : v[x]) {
                if(vis[j])
                    continue;
                vis[j] = 1;
                s.insert(j);
                if(j <= i)
                    continue;
                int dif = decode_bit();
                if(dif) {
                    if(!decode_bit())
                        dif = -1;
                }
                ans[j][i] = ans[i][j] = ans[x][i] + dif;
            }
        }
    }
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 16260 KB Output is correct - 61955 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
3 Correct 35 ms 9808 KB Output is correct - 57973 call(s) of encode_bit()
4 Correct 2 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
5 Correct 40 ms 10272 KB Output is correct - 55306 call(s) of encode_bit()
6 Correct 45 ms 11264 KB Output is correct - 59782 call(s) of encode_bit()
7 Correct 57 ms 11872 KB Output is correct - 50052 call(s) of encode_bit()
8 Correct 43 ms 9256 KB Output is partially correct - 75540 call(s) of encode_bit()
9 Correct 39 ms 9636 KB Output is partially correct - 77419 call(s) of encode_bit()
10 Correct 34 ms 9636 KB Output is partially correct - 77065 call(s) of encode_bit()
11 Correct 38 ms 9688 KB Output is partially correct - 75415 call(s) of encode_bit()
12 Correct 31 ms 9600 KB Output is partially correct - 78660 call(s) of encode_bit()
13 Correct 70 ms 11296 KB Output is correct - 58010 call(s) of encode_bit()
14 Correct 43 ms 9580 KB Output is partially correct - 76899 call(s) of encode_bit()
15 Correct 34 ms 9528 KB Output is partially correct - 74808 call(s) of encode_bit()
16 Correct 54 ms 9972 KB Output is partially correct - 70870 call(s) of encode_bit()
17 Correct 54 ms 10272 KB Output is partially correct - 72586 call(s) of encode_bit()
18 Correct 73 ms 10604 KB Output is correct - 68103 call(s) of encode_bit()
19 Correct 47 ms 10276 KB Output is correct - 64750 call(s) of encode_bit()
20 Correct 72 ms 11420 KB Output is correct - 63958 call(s) of encode_bit()
21 Correct 86 ms 11384 KB Output is correct - 62999 call(s) of encode_bit()
22 Correct 59 ms 11796 KB Output is correct - 52567 call(s) of encode_bit()
23 Correct 84 ms 12464 KB Output is correct - 55868 call(s) of encode_bit()

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 16260 KB Output is correct - 61955 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
3 Correct 35 ms 9808 KB Output is correct - 57973 call(s) of encode_bit()
4 Correct 2 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
5 Correct 40 ms 10272 KB Output is correct - 55306 call(s) of encode_bit()
6 Correct 45 ms 11264 KB Output is correct - 59782 call(s) of encode_bit()
7 Correct 57 ms 11872 KB Output is correct - 50052 call(s) of encode_bit()
8 Correct 43 ms 9256 KB Output is partially correct - 75540 call(s) of encode_bit()
9 Correct 39 ms 9636 KB Output is partially correct - 77419 call(s) of encode_bit()
10 Correct 34 ms 9636 KB Output is partially correct - 77065 call(s) of encode_bit()
11 Correct 38 ms 9688 KB Output is partially correct - 75415 call(s) of encode_bit()
12 Correct 31 ms 9600 KB Output is partially correct - 78660 call(s) of encode_bit()
13 Correct 70 ms 11296 KB Output is correct - 58010 call(s) of encode_bit()
14 Correct 43 ms 9580 KB Output is partially correct - 76899 call(s) of encode_bit()
15 Correct 34 ms 9528 KB Output is partially correct - 74808 call(s) of encode_bit()
16 Correct 54 ms 9972 KB Output is partially correct - 70870 call(s) of encode_bit()
17 Correct 54 ms 10272 KB Output is partially correct - 72586 call(s) of encode_bit()
18 Correct 73 ms 10604 KB Output is correct - 68103 call(s) of encode_bit()
19 Correct 47 ms 10276 KB Output is correct - 64750 call(s) of encode_bit()
20 Correct 72 ms 11420 KB Output is correct - 63958 call(s) of encode_bit()
21 Correct 86 ms 11384 KB Output is correct - 62999 call(s) of encode_bit()
22 Correct 59 ms 11796 KB Output is correct - 52567 call(s) of encode_bit()
23 Correct 84 ms 12464 KB Output is correct - 55868 call(s) of encode_bit()

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 16260 KB Output is correct - 61955 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
3 Correct 35 ms 9808 KB Output is correct - 57973 call(s) of encode_bit()
4 Correct 2 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
5 Correct 40 ms 10272 KB Output is correct - 55306 call(s) of encode_bit()
6 Correct 45 ms 11264 KB Output is correct - 59782 call(s) of encode_bit()
7 Correct 57 ms 11872 KB Output is correct - 50052 call(s) of encode_bit()
8 Correct 43 ms 9256 KB Output is partially correct - 75540 call(s) of encode_bit()
9 Correct 39 ms 9636 KB Output is partially correct - 77419 call(s) of encode_bit()
10 Correct 34 ms 9636 KB Output is partially correct - 77065 call(s) of encode_bit()
11 Correct 38 ms 9688 KB Output is partially correct - 75415 call(s) of encode_bit()
12 Correct 31 ms 9600 KB Output is partially correct - 78660 call(s) of encode_bit()
13 Correct 70 ms 11296 KB Output is correct - 58010 call(s) of encode_bit()
14 Correct 43 ms 9580 KB Output is partially correct - 76899 call(s) of encode_bit()
15 Correct 34 ms 9528 KB Output is partially correct - 74808 call(s) of encode_bit()
16 Correct 54 ms 9972 KB Output is partially correct - 70870 call(s) of encode_bit()
17 Correct 54 ms 10272 KB Output is partially correct - 72586 call(s) of encode_bit()
18 Correct 73 ms 10604 KB Output is correct - 68103 call(s) of encode_bit()
19 Correct 47 ms 10276 KB Output is correct - 64750 call(s) of encode_bit()
20 Correct 72 ms 11420 KB Output is correct - 63958 call(s) of encode_bit()
21 Correct 86 ms 11384 KB Output is correct - 62999 call(s) of encode_bit()
22 Correct 59 ms 11796 KB Output is correct - 52567 call(s) of encode_bit()
23 Correct 84 ms 12464 KB Output is correct - 55868 call(s) of encode_bit()

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 16260 KB Output is correct - 61955 call(s) of encode_bit()
2 Correct 3 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
3 Correct 35 ms 9808 KB Output is correct - 57973 call(s) of encode_bit()
4 Correct 2 ms 4604 KB Output is correct - 47 call(s) of encode_bit()
5 Correct 40 ms 10272 KB Output is correct - 55306 call(s) of encode_bit()
6 Correct 45 ms 11264 KB Output is correct - 59782 call(s) of encode_bit()
7 Correct 57 ms 11872 KB Output is correct - 50052 call(s) of encode_bit()
8 Correct 43 ms 9256 KB Output is partially correct - 75540 call(s) of encode_bit()
9 Correct 39 ms 9636 KB Output is partially correct - 77419 call(s) of encode_bit()
10 Correct 34 ms 9636 KB Output is partially correct - 77065 call(s) of encode_bit()
11 Correct 38 ms 9688 KB Output is partially correct - 75415 call(s) of encode_bit()
12 Correct 31 ms 9600 KB Output is partially correct - 78660 call(s) of encode_bit()
13 Correct 70 ms 11296 KB Output is correct - 58010 call(s) of encode_bit()
14 Correct 43 ms 9580 KB Output is partially correct - 76899 call(s) of encode_bit()
15 Correct 34 ms 9528 KB Output is partially correct - 74808 call(s) of encode_bit()
16 Correct 54 ms 9972 KB Output is partially correct - 70870 call(s) of encode_bit()
17 Correct 54 ms 10272 KB Output is partially correct - 72586 call(s) of encode_bit()
18 Correct 73 ms 10604 KB Output is correct - 68103 call(s) of encode_bit()
19 Correct 47 ms 10276 KB Output is correct - 64750 call(s) of encode_bit()
20 Correct 72 ms 11420 KB Output is correct - 63958 call(s) of encode_bit()
21 Correct 86 ms 11384 KB Output is correct - 62999 call(s) of encode_bit()
22 Correct 59 ms 11796 KB Output is correct - 52567 call(s) of encode_bit()
23 Correct 84 ms 12464 KB Output is correct - 55868 call(s) of encode_bit()