oj.uz

답안 #672047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
672047 2022-12-14T16:27:30 Z alvingogo Flight to the Ford (BOI22_communication) C++17
15 / 100
 7713 ms 11812 KB 
#include <bits/stdc++.h>
#include "communication.h"
using namespace std;

vector<int> use(vector<int> a,vector<int> b,int x,int t){
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    if(a.size()+b.size()<=2){
        vector<int> z;
        for(auto h:a){
            z.push_back(h);
        }
        for(auto h:b){
            z.push_back(h);
        }
        if(z.size()==1){
            z.push_back(z[0]);
        }
        return z;
    }
    vector<int> la,ra,lb,rb;
    if(a.size()+b.size()==3){
        vector<int> g;
        for(auto h:a){
            g.push_back(h);
        }
        for(auto h:b){
            g.push_back(h);
        }
        sort(g.begin(),g.end());
        int u=-1;
        for(int i=0;i<3;i++){
            if(g[i]==x){
                u=i;
            }
        }
        if(t==0){
            return g;
        }
        else{
            string s[3]={"1111","0001","1000"};
            if(u==-1){
                string z;
                for(int j=0;j<4;j++){
                    z+=char('0'+receive());
                }
                int flag=-1;
                for(int i=0;i<3;i++){
                    int lst=0;
                    for(int j=0;j<4;j++){
                        if(s[i][j]!=z[j]){
                            if(lst){
                                flag=i;
                                break;
                            }
                            else{
                                lst=1;
                            }
                        }
                        else{
                            lst=0;
                        }
                    }
                }
                assert(flag>=0);
                vector<int> ret;
                for(int i=0;i<3;i++){
                    if(i!=flag){
                        ret.push_back(g[i]);
                    }
                }
                return ret;
            }
            else{
                for(int i=0;i<4;i++){
                    send(int(s[u][i]-'0'));
                }
                return vector<int>();
            }   
        }
    }
    int as=a.size(),bs=b.size();
    int nxt=-1;
    for(int i=0;i<as/2;i++){
        if(a[i]==x){
            nxt=0;
        }
        la.push_back(a[i]);
        rb.push_back(a[i]);
    }
    for(int i=as/2;i<as;i++){
        if(a[i]==x){
            nxt=1;
        }
        ra.push_back(a[i]);
        lb.push_back(a[i]);
    }
    for(int i=0;i<(bs+1)/2;i++){
        if(b[i]==x){
            nxt=0;
        }
        la.push_back(b[i]);
    }
    for(int i=(bs+1)/2;i<bs;i++){
        if(b[i]==x){
            nxt=1;
        }
        ra.push_back(b[i]);
    }
    int dd;
    if(nxt==-1){
        dd=receive();
    }
    else{
        dd=send(nxt);
    }
    if(dd==0){
        return use(la,lb,x,t);
    }
    else{
        return use(ra,rb,x,t);
    }
}
const int Bd=31647;
void encode(int N,int x){
    int a=x/Bd;
    int c=x%Bd;
    vector<int> v(max(3,N/Bd+2));
    iota(v.begin(),v.end(),0);
    auto e=use(v,vector<int>(),a,0);
    vector<int> w(Bd);
    iota(w.begin(),w.end(),0);
    auto f=use(w,vector<int>(),c,0);
    assert(e.size()==3 && f.size()==3);
    vector<int> z;
    for(auto h:e){
        for(auto y:f){
            if(h*Bd+y<=0 || h*Bd+y>N){
                continue;
            }
            z.push_back(h*Bd+y);
        }
    }
    use(z,vector<int>(),x,1);
}

pair<int,int> decode(int N){
    vector<int> v(max(3,N/Bd+2));
    iota(v.begin(),v.end(),0);
    auto e=use(v,vector<int>(),-1,0);
    vector<int> w(Bd);
    iota(w.begin(),w.end(),0);
    auto f=use(w,vector<int>(),-1,0);
    assert(e.size()==3 && f.size()==3);
    vector<int> z;
    for(auto h:e){
        for(auto y:f){
            if(h*Bd+y<=0 || h*Bd+y>N){
                continue;
            }
            z.push_back(h*Bd+y);
        }
    }
    auto j=use(z,vector<int>(),-1,1);
    return {j[0],j[1]}; 
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 420 ms 6796 KB Output is correct
2 Correct 586 ms 6660 KB Output is correct
3 Correct 846 ms 6680 KB Output is correct
4 Correct 437 ms 6844 KB Output is correct
5 Correct 593 ms 6740 KB Output is correct
6 Correct 1533 ms 11812 KB Output is correct
7 Correct 2991 ms 6732 KB Output is correct

Subtask #2
0.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 5429 ms 7280 KB Output is partially correct
2 Partially correct 3419 ms 6944 KB Output is partially correct
3 Partially correct 4349 ms 7084 KB Output is partially correct
4 Partially correct 7713 ms 7340 KB Output is partially correct
5 Partially correct 6361 ms 7448 KB Output is partially correct
6 Correct 5439 ms 7156 KB Output is correct
7 Incorrect 6257 ms 2884 KB Security violation!
8 Halted 0 ms 0 KB -