oj.uz

Submission #672083

# Submission time Handle Problem Language Result Execution time Memory
672083 2022-12-14T17:10:53 Z alvingogo Flight to the Ford (BOI22_communication) C++17
15 / 100
 8000 ms 9424 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());
    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;
vector<int> emp;
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,emp,a,0);
    vector<int> w(Bd);
    iota(w.begin(),w.end(),0);
    auto f=use(w,emp,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,emp,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,emp,-1,0);
    vector<int> w(Bd);
    iota(w.begin(),w.end(),0);
    auto f=use(w,emp,-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,emp,-1,1);
    return {j[0],j[1]}; 
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 5204 KB Output is correct
2 Correct 550 ms 5484 KB Output is correct
3 Correct 797 ms 5304 KB Output is correct
4 Correct 380 ms 5240 KB Output is correct
5 Correct 531 ms 5140 KB Output is correct
6 Correct 1515 ms 8888 KB Output is correct
7 Correct 2881 ms 5264 KB Output is correct

Subtask #2
0.0 / 85.0

# Verdict Execution time Memory Grader output
1 Partially correct 4861 ms 5464 KB Output is partially correct
2 Partially correct 3040 ms 5468 KB Output is partially correct
3 Partially correct 3703 ms 5492 KB Output is partially correct
4 Partially correct 6688 ms 5468 KB Output is partially correct
5 Partially correct 5863 ms 5456 KB Output is partially correct
6 Correct 4824 ms 5624 KB Output is correct
7 Execution timed out 8000 ms 9424 KB
8 Halted 0 ms 0 KB -