Submission #301013

#	Time	Username	Problem	Language	Result	Execution time	Memory
301013		luciocf	Comparing Plants (IOI20_plants)	C++14	0 / 100	84 ms	3452 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"

using namespace std;

const int maxn = 2e5+10;

int n;
int head[maxn];

int r[maxn];

void init(int k, vector<int> a)
{
	n = a.size();
	for (int i = 0; i < n; i++)
		r[i] = a[i];

	head[0] = head[1] = 0;
	int at = r[0];

	for (int i = 1; i < n-1; i++)
	{
		if (r[i] == at) head[i+1] = head[i];
		else
		{
			head[i+1] = i;
			at = r[i];
		}
	}
}

int compare_plants(int x, int y)
{
	if (min(x, y) != 0 && max(x, y) != n-1)
	{
		if (x < y && head[y] > x) return 0;
		if (x > y && head[x] > y) return 0;

		if (x < y)
		{
			if (r[x] == 0) return 1;
			return -1;
		}
		else
		{
			if (r[y] == 0) return -1;
			return 1;
		}
	}
	
	if (x == 0)
	{
		if (head[n-1] <= y)
		{
			if (r[n-1] == 0 && r[y] == 0) return -1;
			if (r[n-1] == 1 && r[y] == 1) return 1;
			return 0;
		}
		else
		{
			if (head[y] > x) return 0;

			if (r[x] == 0) return 1;
			return -1;
		}
	}
	else if (y == 0)
	{
		if (head[n-1] <= x)
		{
			if (r[n-1] == 0 && r[x] == 0) return 1;
			if (r[n-1] == 1 && r[x] == 1) return -1;
			return 0;
		}
		else
		{
			if (head[x] > y) return 0;

			if (r[y] == 0) return -1;
			return 1;
		}
	}

	if (x == n-1)
	{
		if (head[y] <= 0)
		{
			if (r[n-1] == 0 && r[0] == 0) return 1;
			if (r[n-1] == 1 && r[0] == 1) return -1;
			return 0;
		}
		else
		{
			if (head[x] > y) return 0;

			if (r[y] == 0) return -1;
			return 1;
		}
	}
	else if (y == n-1)
	{
		if (head[x] <= 0)
		{
			if (r[n-1] == 0 && r[0] == 0) return -1;
			if (r[n-1] == 1 && r[0] == 1) return 1;
			return 0;
		}
		else
		{
			if (head[y] > x) return 0;

			if (r[x] == 0) return 1;
			return -1;
		}
	}
}

Compilation message (stderr)

plants.cpp: In function 'int compare_plants(int, int)':
plants.cpp:117:1: warning: control reaches end of non-void function [-Wreturn-type]
  117 | }
      | ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25