Submission #672078

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
672078	2022-12-14T16:58:51 Z	alvingogo	Flight to the Ford (BOI22_communication)	C++17	15 / 100	7664 ms	11960 KB

communication

#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());
    int as=a.size();
    int bs=b.size();
    vector<int> la,ra,lb,rb;
    if(as+bs<=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;
    }
    else if(as+bs==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;
                        }
                    }
                }
                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 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);
    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);
    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

#	Verdict	Execution time	Memory	Grader output
1	Correct	412 ms	6704 KB	Output is correct
2	Correct	533 ms	6864 KB	Output is correct
3	Correct	856 ms	6708 KB	Output is correct
4	Correct	403 ms	6680 KB	Output is correct
5	Correct	563 ms	6676 KB	Output is correct
6	Correct	1568 ms	11960 KB	Output is correct
7	Correct	3211 ms	6852 KB	Output is correct

Subtask #2

0.0 / 85.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	5432 ms	7212 KB	Output is partially correct
2	Partially correct	3458 ms	7016 KB	Output is partially correct
3	Partially correct	4454 ms	7288 KB	Output is partially correct
4	Partially correct	7664 ms	7232 KB	Output is partially correct
5	Partially correct	6525 ms	7260 KB	Output is partially correct
6	Correct	5488 ms	7108 KB	Output is correct
7	Incorrect	5661 ms	2892 KB	Security violation!
8	Halted	0 ms	0 KB	-