oj.uz

답안 #130969

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
130969 2019-07-16T10:29:09 Z semiauto CEOI16_icc (CEOI16_icc) C++14
18 / 100
 163 ms 632 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
int i,j,k,sa,sb,l,r,m,x,q,alo,balo;
int parent[101],mas[101],a[101],b[101];
bool fix[101],go[101][101];
int n;/*
bool query(int a,int b,int *A,int *B) {
    int i,j;
    for (i=0;i<a;i++)
        for (j=0;j<b;j++)
            if (go[A[i]][B[j]])
                return true;
    return false;
}
void setRoad(int a,int b) {
    cout<<a<<" "<<b<<endl;
    cin>>alo>>balo;
    go[alo][balo]=go[balo][alo]=1;
}*/
void run(int n) {
    srand(time(NULL));
    for (i=1;i<=n;i++)
        parent[i]=i;
    for (j=1;j<n;j++) {
        for (i=1;i<=n;i++)
            fix[i]=0;
        for (i=1;i<=n;i++)
            fix[parent[i]]=1;
        k=0;
        for (i=1;i<=n;i++)
            if (fix[i])
                mas[k++]=i;
        while (true) {
            for (i=0;i<k;i++)
                fix[mas[i]]=rand()%2;
            sa=sb=0;
            for (i=0;i<=n;i++)
                a[i]=b[i]=0;
            for (i=1;i<=n;i++) {
                if (fix[parent[i]])
                    a[sa++]=i;
                else
                    b[sb++]=i;
            }q++;
            if (query(sa,sb,a,b))
                break;
        }
        if (q>600)return;
        l=1;r=sa;
        while (l!=r) {
            m=(l+r)/2;
            for (i=0;i<=n;i++)
                mas[i]=0;
            for (i=l;i<=m;i++)
                mas[i-l]=a[i-1];
            if (query(m-l+1,sb,mas,b))
                r=m;
            else
                l=m+1;
        }
        x=l;
        l=1;r=sb;
        while (l!=r) {
            m=(l+r)/2;
            for (i=0;i<=n;i++)
                mas[i]=0;
            for (i=l;i<=m;i++)
                mas[i-l]=b[i-1];
            if (query(sa,m-l+1,a,mas))
                r=m;
            else
                l=m+1;
        }
        int solo=parent[a[x-1]];
        for (i=1;i<=n;i++)
            if (parent[i]==solo)
                parent[i]=parent[b[l-1]];
        setRoad(b[l-1],a[x-1]);
    }
    return;
}/*
int main() {
    cin>>n;
    cin>>alo>>balo;
    go[alo][balo]=go[balo][alo]=1;
    run(n);
    return 0;
}*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 504 KB Ok! 108 queries used.
2 Correct 8 ms 504 KB Ok! 97 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 504 KB Ok! 536 queries used.
2 Correct 66 ms 552 KB Ok! 847 queries used.
3 Correct 62 ms 504 KB Ok! 785 queries used.

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 572 KB Ok! 1511 queries used.
2 Incorrect 121 ms 504 KB Not all edges were guessed!
3 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 163 ms 556 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 136 ms 504 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 143 ms 632 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -