oj.uz

Submission #369752

# Submission time Handle Problem Language Result Execution time Memory
369752 2021-02-22T11:22:16 Z MilosMilutinovic Comparing Plants (IOI20_plants) C++14
0 / 100
 1 ms 364 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;

int n, k;
vector<int> a;

int compare_plants(int x, int y) {
	if(x==n-1) {
		if(y==x-1) {
			if(!a[y])
				return -1;
			return 1;
		} else {
			if(y!=0)
				return 0;
			if(!a[x])
				return 1;
			return -1;
		}
	} else {
		if(x==0) {
			if(y==n-1) {
				if(!a[y])
					return -1;
				return 1;
			} else {
				if(y!=1)
					return 0;
				if(!a[x])
					return 1;
				return -1;
			}
		} else {
			if(abs(x-y)!=1)
				return 0;
			if(x<y) {
				if(!a[x])
					return 1;
				return -1;
			} else {
				if(!a[y])
					return -1;
				return 1;
			}
		}
	}
}

void init(int K, vector<int> r) {
	n=(int)r.size(), k=K, a=r;
}

/*int main() {
	init(2, {0, 1, 0, 1});
	cout << compare_plants(1, 2);
	return 0;
}*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Halted 0 ms 0 KB -