제출 #226300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
226300		kshitij_sodani	Meetings (JOI19_meetings)	C++17	17 / 100	3087 ms	16128 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 vis[n][n];
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			vis[i][j]=0;
		}
	}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			int st=1;
			for(int k=0;k<n;k++){
				if(k==i or k==j){
					continue;
				}
				int x=Query(i,j,k);
				if(x==k){
					st=0;
					break;
				}
			}
			vis[i][j]=st;
		}
	}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(vis[i][j]==1){
				Bridge(i,j);
			}
		}
	}
}

/*int main(){




	return 0;
}*/

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