oj.uz

Submission #942613

# Submission time Handle Problem Language Result Execution time Memory
942613 2024-03-11T01:23:41 Z yeediot Meetings (JOI19_meetings) C++14
0 / 100
 26 ms 600 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(time(0));
int K;
bool cmp(int a,int b){
    return Query(K,a,b)==a;
}
void qq(int a,int b){
    if(a>b)swap(a,b);
    Bridge(a,b);
}
void go(int k,vector<int>temp){
    if(temp.size()==0)return;
    int n=temp.size();
    int k2=rng()%n;
    K=k;
    vector<int>child[n],path;
    for(auto i:temp){
        int p=Query(k,k2,i);
        if(p==i){
            path.push_back(i);
        }
        else{
            child[p].push_back(i);
        }
    }
    sort(path.begin(),path.end(),cmp);
    for(int i=0;i<n;i++){
        if(!i){
            qq(k,path[i]);
        }
        else{
            qq(path[i-1],path[i]);
        }
    }
    go(k,child[k]);
    for(auto i:path){
        go(i,child[i]);
    }
}
void Solve(int N){
    int n=N;
    int k=rng()%n;
    vector<int>temp;
    for(int i=0;i<n;i++){
        if(i!=k)temp.push_back(i);
    }
    go(k,temp);
}
 /*
 input:
 
 */

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 600 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -