oj.uz

답안 #601717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601717 2022-07-22T09:22:32 Z 박상훈(#8471) Flight to the Ford (BOI22_communication) C++17
74 / 100
 4370 ms 2368 KB 
#include "communication.h"
#include <bits/stdc++.h>
//
// --- Sample implementation for the task communication ---
//
// To compile this program with the sample grader, place:
//     communication.h communication_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 communication_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//

using namespace std;
typedef long long ll;
int valid[128];

int _find(const vector<pair<int, int>> &V, int S, int k, int X){
    int cur = V[0].first;
    int pt = 0;
    int ret = 0;

    int rem = S / k;
    if (S%k) rem++;

    while(true){
        int r = min(cur+rem-1, V[pt].second);
        if (X>=cur && X<=r) return ret;

        S -= r-cur+1;
        rem -= r-cur+1;
        if (rem==0){
            --k;
            assert(k);

            rem = S/k;
            if (S%k) rem++;
            ret++;
        }

        cur = r+1;
        if (cur>V[pt].second){
            ++pt;
            cur = V[pt].first;
        }
    }
    assert(0);
}

void _modify(vector<pair<int, int>> &V, int &S, int k, int val){
    vector<pair<int, int>> ret;
    int retS = 0;

    int cur = V[0].first;
    int pt = 0, idx = 0;

    int rem = S / k;
    if (S%k) rem++;

    while(true){
        int r = min(cur+rem-1, V[pt].second);
        if (valid[idx^val]){
            //printf(" %d %d\n", idx, val);
            ret.emplace_back(cur, r);
            retS += r-cur+1;
        }

        S -= r-cur+1;
        rem -= r-cur+1;
        if (rem==0){
            --k;
            if (!k) break;

            rem = S/k;
            if (S%k) rem++;
            idx++;
        }

        cur = r+1;
        if (cur>V[pt].second){
            ++pt;
            cur = V[pt].first;
        }
    }

    swap(V, ret);
    swap(S, retS);
}

vector<int> get_last(const vector<pair<int, int>> &V){
    vector<int> ret;
    for (auto &[l, r]:V){
        for (int i=l;i<=r;i++) ret.push_back(i);
    }
    assert(ret.size()==3);
    return ret;
}

void process(vector<pair<int, int>> &V, int &S, int k, int encode, int t){
    while(S>=k){
        int val = 0;
        if (encode) val = _find(V, S, k, encode);
        int rval = 0;

        if (encode){
            for (int i=0;i<t;i++){
                if (val&(1<<i)) rval |= (send(1)<<i);
                else rval |= (send(0)<<i);
            }
        }

        else{
            for (int i=0;i<t;i++){
                rval |= (receive()<<i);
            }
        }


        _modify(V, S, k, rval);

        //for (auto &[l, r]:V) printf("[%d, %d] ", l, r);
        //printf("-> %d\n", S);
    }
}

void encode(int N, int X) {

    for (int i=0;i<128;i++){
        valid[i] = 1;
        for (int j=0;j<6;j++) if ((i&(1<<j)) && (i&(1<<(j+1)))) valid[i] = 0;
    }

    vector<pair<int, int>> V = {{1, N}};
    int S = N;

    process(V, S, 128, X, 7);
    process(V, S, 4, X, 2);




    vector<int> last = get_last(V);
    X = find(last.begin(), last.end(), X) - last.begin() + 1;
    assert(X<=3);
    string s[4] = {"", "10", "11", "01"};

    bool flag = 0;
    for (int i=0;i<3;i++){
        if (!flag) flag = (((s[X][0]-'0')^1) != send((s[X][0]-'0') ^ 1));
        else{
            send(s[X][1]-'0');
            flag = 0;
        }
    }
}

std::pair<int, int> decode(int N) {
    for (int i=0;i<128;i++){
        valid[i] = 1;
        for (int j=0;j<6;j++) if ((i&(1<<j)) && (i&(1<<(j+1)))) valid[i] = 0;
    }

    vector<pair<int, int>> V = {{1, N}};
    int S = N;

    process(V, S, 128, 0, 7);
    process(V, S, 4, 0, 2);

    vector<int> last = get_last(V);
    vector<int> v;
    for (int i=0;i<3;i++){
        int x = receive();
        v.push_back(x);
        if (i && v[i-1]==v[i]){
            if (v[i]==1) return {last[1], last[2]};
            else return {last[0], last[1]};
        }
    }
    return {last[0], last[2]};
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1936 KB Output is correct
2 Correct 15 ms 1876 KB Output is correct
3 Correct 15 ms 1896 KB Output is correct
4 Correct 13 ms 1960 KB Output is correct
5 Correct 16 ms 1772 KB Output is correct
6 Correct 21 ms 1800 KB Output is correct
7 Correct 42 ms 1956 KB Output is correct

Subtask #2
59.00003 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 949 ms 1932 KB Output is partially correct
2 Partially correct 410 ms 1880 KB Output is partially correct
3 Partially correct 612 ms 1844 KB Output is partially correct
4 Partially correct 888 ms 1860 KB Output is partially correct
5 Partially correct 915 ms 1892 KB Output is partially correct
6 Partially correct 787 ms 1784 KB Output is partially correct
7 Partially correct 2840 ms 1904 KB Output is partially correct
8 Partially correct 4370 ms 2368 KB Output is partially correct
9 Partially correct 3753 ms 1936 KB Output is partially correct
10 Partially correct 3605 ms 2004 KB Output is partially correct
11 Partially correct 3602 ms 2080 KB Output is partially correct
12 Partially correct 3766 ms 1964 KB Output is partially correct
13 Partially correct 3873 ms 2156 KB Output is partially correct
14 Partially correct 3787 ms 2088 KB Output is partially correct
15 Partially correct 2269 ms 1912 KB Output is partially correct
16 Partially correct 4101 ms 1960 KB Output is partially correct
17 Partially correct 824 ms 1980 KB Output is partially correct
18 Partially correct 970 ms 2016 KB Output is partially correct
19 Partially correct 1055 ms 2004 KB Output is partially correct
20 Partially correct 1077 ms 1860 KB Output is partially correct
21 Partially correct 1221 ms 2044 KB Output is partially correct
22 Partially correct 873 ms 2164 KB Output is partially correct
23 Partially correct 1636 ms 1968 KB Output is partially correct
24 Correct 11 ms 1800 KB Output is correct
25 Correct 15 ms 1664 KB Output is correct
26 Correct 14 ms 1780 KB Output is correct
27 Correct 9 ms 1860 KB Output is correct
28 Correct 14 ms 1780 KB Output is correct
29 Correct 28 ms 1896 KB Output is correct
30 Correct 48 ms 1740 KB Output is correct