oj.uz

Submission #60405

# Submission time Handle Problem Language Result Execution time Memory
60405 2018-07-24T06:18:29 Z 정원준(#1745) Park (JOI17_park) C++11
0 / 100
 3 ms 652 KB 
#include "park.h"
#include <bits/stdc++.h>
#define L long long

using namespace std;

void Answer(int,int);
int Ask(int,int,int*);

int t,n;
int arr[2222];


void Detect(int T,int N){
	t=T;
	n=N;
	int i,j;
	if(t==1)
	{
		for(i=1;i<=n;i++)
		{
			for(j=i+1;j<=n;j++)
			{
				arr[i-1]=arr[j-1]=1;
				int temp=Ask(i-1,j-1,arr);
				if(temp==1) Answer(i-1,j-1);
			}
		}
		return;
	}
}
/*
int Ask(int st,int ed,int *arr){
    return 1;
}

void Answer(int s,int e){

}
int main()
{

}
*/

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 616 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 616 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 652 KB Wrong Answer[6]
2 Halted 0 ms 0 KB -