oj.uz

Submission #429383

# Submission time Handle Problem Language Result Execution time Memory
429383 2021-06-15T22:18:09 Z JUANDI321 Comparing Plants (IOI20_plants) C++17
0 / 100
 1 ms 204 KB 
#include "plants.h"
#include <vector>
#include <iostream>

using namespace std;
int l[200100];
int n;
void init(int k, vector<int> r) 
{
	int nn = r.size();
	n = nn;
	l[0] = 200100;
	for(int i = 0; i<n; i++)
	{
		if(r[i] == 1)l[i+1] = l[i] + 1;
		else l[i+1] = l[i] - 1;
	}
	return;
}

int compare_plants(int x, int y) 
{
	if( y-x == l[y]-l[x])return 1;
	if( y-x == -1 *(l[y]-l[x]))return -1;
	if( n-y + x == l[n]-l[y] + l[x] - l[0])return -1;
	if( n-y + x == -1*(l[n]-l[y] + l[x] - l[0]))return 1;
	return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -