제출 #223449

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
223449		MKopchev	ICC (CEOI16_icc)	C++14	7 / 100	518 ms	632 KiB

icc

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

const int nmax=100+42;
/*
void setRoad(int a,int b)
{
    cout<<"set "<<a<<" "<<b<<endl;
}

int query(int size_a,int size_b,int a[],int b[])
{
    cout<<"size_a "<<size_a<<" a ";for(int i=0;i<size_a;i++)cout<<a[i]<<" ";cout<<endl;

    cout<<"size_b "<<size_b<<" b ";for(int i=0;i<size_b;i++)cout<<b[i]<<" ";cout<<endl;

    int ret;
    cin>>ret;
    return ret;
}
*/
int size_a,size_b,a[nmax],b[nmax];

int n;

int parent[nmax];

int root(int node)
{
    if(node==parent[node])return parent[node];
    parent[node]=root(parent[node]);
    return parent[node];
}

int my_ask(vector<int> lhs,vector<int> rhs)
{
    size_a=lhs.size();
    for(int i=0;i<size_a;i++)
        a[i]=lhs[i];

    size_b=rhs.size();
    for(int i=0;i<size_b;i++)
        b[i]=rhs[i];

    return query(size_a,size_b,a,b);
}

void run(int N)
{
    n=N;
    for(int i=1;i<=n;i++)parent[i]=i;

    for(int i=1;i<n;i++)
    {
        for(int u=1;u<=n;u++)
            for(int v=u+1;v<=n;v++)
                if(root(u)!=root(v))
                {
                    if(my_ask({u},{v}))
                    {
                        setRoad(u,v);
                        parent[root(u)]=root(v);
                        u=n;
                        v=n;
                    }
                }
    }
}
/*
int main()
{
    run(4);
}
*/

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