Submission #101247

#	Time	Username	Problem	Language	Result	Execution time	Memory
101247		cheeheng	ICC (CEOI16_icc)	C++14	0 / 100	3 ms	384 KiB

icc

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

//int query(int a,int b,int* A,int *B);
//void setRoad(int a,int b);

int a[105];
int b[105];
int P[105];

bool hasEdge[105][105];

void run(int n) {
    for(int i = 0; i < n; i ++){
        P[i] = i+1;
    }

    for(int k = 1; k < n; k ++){
        for(int i = 1; i <= n; i ++){
            int cnt = 0;
            for(int j = i; j <= n; j ++){
                if(!hasEdge[j][i]){
                    b[cnt++] = j;
                }
            }
            a[0] = i;
            if(query(1, cnt, a, b)){
                for(int j = i; j <= n; j ++){
                    b[0] = j;
                    if(!hasEdge[j][i]){
                        if(query(1, 1, a, b)){
                            hasEdge[j][i] = true;
                            hasEdge[i][j] = true;
                            //printf("%d %d\n", i, j);
                            setRoad(i, j);
                        }
                    }
                }
                break;
            }
        }
    }
}

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