oj.uz

답안 #604568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
604568 2022-07-25T07:44:20 Z BJoozz CEOI16_icc (CEOI16_icc) C++14
61 / 100
 172 ms 492 KB 
#include "icc.h";
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define X first
#define Y second
//#define int long long
mt19937 rng(time(0));
bool randint(int l,int r){
    return uniform_int_distribution < int > (l,r) (rng);
}
void maxx(int &a,int b){if(b>a) a=b;}
void minn(int &a,int b){if(b<a) a=b;}

using ll = long long;
using ii = pair < int , int >;
const int MAX=100+3,inf=1e9,mod=1e9+7;
//int tim=0,sz[MAX];
bool b[MAX];
int pa[MAX];
int A[MAX],B[MAX];
/*vector < int > V[MAX];
int query ( int n,int m,int a[],int b[]){
    return 1;
}
void setRoad(int u,int v){cout<<u<<' '<<v<<'\n';}*/
void run(int N){
    int n=N;
    vector < int > vec;
    for(int i=1;i<=n;i++) pa[i]=i,vec.pb(i);
    for(int k=1;k<n;k++){
        int cn=0,m=0;
        while(1){
            for(int i=1;i<=n;i++)b[i]=randint(0,1);
            cn=0;m=0;
            shuffle(vec.begin(),vec.end(),rng);
            for(int i:vec)if(b[pa[i]])
            A[cn++]=i;else B[m++]=i;
            if(query(cn,m,A,B))break;
        }
        for(int i=__lg(cn);i>=0;i--)
            if(cn>(1<<i) && query(cn-(1<<i),m,A,B))cn-=(1<<i);
        for(int i=__lg(m);i>=0;i--)
            if(m>(1<<i) && query(cn,m-(1<<i),A,B))m-=(1<<i);
        int u=A[cn-1],v=B[m-1];
        setRoad(u,v);
        u=pa[u];v=pa[v];
        for(int i=1;i<=n;i++) if(pa[i]==v) pa[i]=u;
    }
}

Compilation message

icc.cpp:1:17: warning: extra tokens at end of #include directive
    1 | #include "icc.h";
      |                 ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 468 KB Ok! 106 queries used.
2 Correct 7 ms 468 KB Ok! 111 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 488 KB Ok! 578 queries used.
2 Correct 52 ms 468 KB Ok! 904 queries used.
3 Correct 45 ms 492 KB Ok! 830 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 484 KB Ok! 1589 queries used.
2 Correct 171 ms 484 KB Ok! 2173 queries used.
3 Correct 154 ms 488 KB Ok! 1686 queries used.
4 Correct 139 ms 468 KB Ok! 1771 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 468 KB Ok! 1686 queries used.
2 Correct 172 ms 484 KB Ok! 1768 queries used.
3 Correct 150 ms 484 KB Ok! 1941 queries used.
4 Correct 119 ms 484 KB Ok! 1571 queries used.

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 148 ms 480 KB Too many queries! 1917 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 166 ms 484 KB Too many queries! 1936 out of 1625
2 Halted 0 ms 0 KB -