제출 #984654

#제출 시각아이디문제언어결과실행 시간메모리
984654vjudge1ICC (CEOI16_icc)C++17
0 / 100
211 ms860 KiB
#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

#define pb push_back
#define deb(x) cout<<#x<<": "<<x<<endl;
int myQuery(vector<int> &v1, vector<int> &v2){
    int a=v1.size();
    int b=v2.size();

    int A[v1.size()];
    int B[v2.size()];
    for(int i=0; i<a; ++i){
        A[i]=v1[i];
       
    }
    for(int i=0; i<b; ++i){
        B[i]=v2[i];
      
    }
    int bo=query(a,b,A,B);
    
    return bo;
}



void run(int N) {
    vector<vector<bool>> adj (N+1, vector<bool> (N+1, false));
    for(int a=0; a<N-1; ++a){
        vector<bool> v (N+1, false);
      
        for(int i=1; i<=N; ++i){
            vector<int> v1;
            vector<int> v2;
           
            v1.pb(i);
            for(int x=1; x<=N; ++x){
                if(x==i) continue;
                if(!adj[i][x]){
                  
                    v2.pb(x);
                }
            }
            int bo=myQuery(v1, v2);
       
            if(bo==1){
        
                v[i]=true;
            }
        }
        int x=-1;
        int y=-1;
        for(int i=1; i<=N; ++i){
            if(v[i]){
                if(x==-1){
                    x=i;
                }
                else{
                    y=i;
                }
            }
        }
     
        adj[x][y]=1;
        adj[y][x]=1;
        setRoad(x,y);
    }
    return;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...