Submission #915568

#TimeUsernameProblemLanguageResultExecution timeMemory
915568guagua0407Meetings (JOI19_meetings)C++17
17 / 100
1668 ms1232 KiB
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;

void Solve(int n) {
    vector<vector<bool>> ok(n,vector<bool>(n));
    for(int i=0;i<n;i++){
        int cnt=0;
        for(int j=i+1;j<n and cnt<18;j++){
            if(ok[i][j]) continue;
            bool tf=true;
            for(int k=0;k<n;k++){
                if(k==i or k==j) continue;
                int x=Query(i,j,k);
                if(x==k){
                    tf=false;
                    break;
                }
                else if(x!=i and x!=j){
                    ok[i][k]=ok[k][i]=ok[j][k]=ok[k][j]=true;
                }
            }
            if(tf){
                cnt++;
                Bridge(i,j);
            }
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...