Submission #226330

#	Time	Username	Problem	Language	Result	Execution time	Memory
226330		kshitij_sodani	Meetings (JOI19_meetings)	C++17	0 / 100	3086 ms	1144 KiB

meetings

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl "\n"
#include "meetings.h"

void Solve(int n){
	
	/*int arr[n];
	for(int i=0;i<n;i++){
		arr[i]=i;
	}*/
	int co[n];
	for(int i=0;i<n;i++){
		co[i]=0;
	}
	vector<int> dd[n];
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			for(int kk=0;kk<n;kk++){
				int k=kk;
				if(k==i or k==j){
					continue;
				}
				int x=Query(i,j,k);
				if(i!=x){
					co[i]+=1;
					dd[i].pb(i);
				}
				if(j!=x){
					co[j]+=1;
					dd[x].pb(j);
				}
				break;
			}
		}
	}
	queue<int> ac;
	for(int i=0;i<n;i++){
		if(co[i]==0){
			ac.push(i);
		}
	}
	int par[n];
	for(int i=0;i<n;i++){
		par[i]=-1;
	}
	while(ac.size()){
		int x=ac.front();
		ac.pop();
		for(auto j:dd[x]){
			co[j]-=1;
			if(co[j]==0){
				par[j]=x;
				ac.push(j);
			}
		}
	}
	for(int i=0;i<n;i++){
		if(par[i]>-1){
			Bridge(par[i],i);
		}
	}


}

/*int main(){




	return 0;
}*/

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