oj.uz

Submission #97830

# Submission time Handle Problem Language Result Execution time Memory
97830 2019-02-18T18:43:12 Z KLPP ICC (CEOI16_icc) C++14
0 / 100
 368 ms 676 KB 
#include<bits/stdc++.h>
#include "icc.h"
using namespace std;
typedef long long int lld;
set<pair<int,int> >S;
void run(int N){
	/*if(v.size()<2){
		v.clear();
		for(int i=0;i<N;i++)v.push_back(i+1);
	}
	for(int i=v.size()-1;i>-1;i--){
		int arr1[N];
		int arr2[N];
		arr1[0]=v[i];
		for(int j=0;j<i;j++)arr2[j]=v[j];
		if(query(1,i,arr1,arr2)){//arr[i] é vertice
			for(int j=0;j<i;j++){
				arr2[0]=v[j];
				if(query(1,1,arr1,arr2)){
					
				}
			}
		}
	}*/
	for(int i=1;i<=N;i++){
		for(int j=i+1;j<=N;j++){
			int arr1[1];
			int arr2[1];
			arr1[0]=i;
			arr2[0]=j;
			if(S.find(pair<int,int>(i,j))==S.end()){
			if(query(1,1,arr1,arr2)==1){
				S.insert(pair<int,int>(i,j));
				setRoad(i,j);
				return;
			}
			}
		}
	}
	
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 512 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 85 ms 512 KB Not all edges were guessed!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 368 ms 676 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 302 ms 560 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 281 ms 560 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 261 ms 564 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -