oj.uz

답안 #320614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320614 2020-11-09T08:54:48 Z arnold518 Park (JOI17_park) C++14
10 / 100
 267 ms 636 KB 
#include "park.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1500;

int T, N;
int P[MAXN+10];

int query(int A, int B)
{
	return Ask(A, B, P);	
}

void Detect(int _T, int _N)
{
	T=_T; N=_N;
	for(int i=0; i<N; i++) P[i]=1;

	vector<int> V;
	for(int i=1; i<N-1; i++) V.push_back(i);

	sort(V.begin(), V.end(), [&](const int &p, const int &q)
	{
		if(p==q) return false;
		P[p]=0;
		int t=query(0, q);
		P[p]=1;
		return !t;
	});
	
	Answer(0, V.front());
	for(int i=0; i+1<V.size(); i++) Answer(min(V[i], V[i+1]), max(V[i], V[i+1]));
	Answer(V.back(), N-1);
}

Compilation message

park.cpp: In function 'void Detect(int, int)':
park.cpp:37:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for(int i=0; i+1<V.size(); i++) Answer(min(V[i], V[i+1]), max(V[i], V[i+1]));
      |               ~~~^~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 225 ms 492 KB Output is correct
2 Correct 90 ms 492 KB Output is correct
3 Correct 110 ms 636 KB Output is correct
4 Correct 225 ms 492 KB Output is correct
5 Correct 228 ms 492 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 214 ms 484 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 95 ms 364 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 267 ms 492 KB Wrong Answer[2]
2 Halted 0 ms 0 KB -