Submission #1289774

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289774		lambd47	ICC (CEOI16_icc)	C++20	0 / 100	1 ms	336 KiB

icc

#include<bits/stdc++.h>
#include"icc.h"
using namespace std;

#define ll long long
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define R(i,j,k) for(int i=(j);i>=(k);i--)
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()

int query(int a, int b, vector<int> va, vector<int> vb){
    return 1;
}


const int MX=1e2+7;
const int lg=7;

void run(int n){
    vector<vector<int>> vec(n);
    L(i,0,n-1)vec[i].push_back(i+1);

    auto ask=[&](vector<int> a, vector<int> b)->bool{
        return query(sz(a),sz(b),a,b);
    };

    R(tam,n,2){
        vector<vector<int>> v(2);
        L(i,0,lg-1){
            L(j,0,tam-1){
                int b=((1<<i)&j)?1:0;
                for(auto a:vec[j])v[i].push_back(a);
            }
            if(ask(v[0],v[1]))break;
        }
        int l=0;int r=sz(v[0])-1;
        int ans=0;
        vector<int> aux;
        while(l<=r){
            aux.clear();
            int m=(l+r)/2;
            L(i,l,m)aux.push_back(v[0][i]);
            if(ask(aux,v[1])){
                ans=l;
                r=m-1;
            }
            else{
                ans=r;
                l=m+1;
            }
        }
        vector<int> goat;goat.push_back({v[0][ans]});
        l=0;r=sz(v[1])-1;
        ans=l;
        while(l<=r){
            aux.clear();
            int m=(l+r)/2;
            L(i,l,m)aux.push_back(v[1][i]);
            if(ask(aux,v[1])){
                ans=l;
                r=m-1;
            }
            else{
                ans=r;
                l=m+1;
            }
        }
        int a=goat[0];
        int b=v[1][ans];
        setRoad(a,b);
        int ida;int idb;
        L(i,0,tam-1){
            for(auto x:vec[i]){
                if(x==a)ida=i;
                if(x==b)idb=i;
            }
        }
        for(auto x:vec[a])vec[b].push_back(x);
        swap(vec[tam-1],vec[a]);
    }
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10