Submission #1170903

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170903		bbartek	Meetings (JOI19_meetings)	C++20	0 / 100	1279 ms	1232 KiB

meetings

#include <bits/stdc++.h>
#include "meetings.h"

using namespace std;

typedef long long ll;
#define st first
#define nd second
#define pb push_back

const int maxn = 2003;

bool polaczone[maxn];
vector<int> synowie[maxn];
vector<int> kolejnosc;

bool porownaj(int a,int b){
    return synowie[a].size() < synowie[b].size();
}


void Solve(int n) {   //Query(a,b,c)//Bridge(a,b)//
    int x;
    for(int i=1;i<n;i++){
        for(int j=i+1;j<n;j++){
            x = Query(0,i,j);
            if(x == i){
                synowie[i].pb(j);
            }
            else{
                synowie[j].pb(i);
            }
        }
        kolejnosc.pb(i);
    }

    sort(kolejnosc.begin(),kolejnosc.end(),porownaj);

    for(auto i : kolejnosc){
        for(auto j : synowie[i]){
            if(polaczone[j])
                continue;
            Bridge(i,j);
            polaczone[j] = 1;
        }
    }

    for(int i=1;i<n;i++){
        if(!polaczone[i])
            Bridge(0,i);
    }
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 71