oj.uz

Submission #226297

# Submission time Handle Problem Language Result Execution time Memory
226297 2020-04-23T10:47:12 Z kshitij_sodani Meetings (JOI19_meetings) C++17
0 / 100
 90 ms 16128 KB 
#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+1,j+1,k+1);
				if(x==k+1){
					st=0;
				}
			}
			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+1,j+1);
			}
		}
	}
}

/*int main(){




	return 0;
}*/

Subtask #1
0 / 7.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 71.0

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