oj.uz

Submission #961598

# Submission time Handle Problem Language Result Execution time Memory
961598 2024-04-12T08:44:16 Z Gr1sen Comparing Plants (IOI20_plants) C++17
0 / 100
 0 ms 348 KB 
#include "plants.h"
#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

#define vi vector<int>
#define vvi vector<vi>

vi R;

void init(int k, std::vector<int> r) {
	R = r;
}

int compare_plants(int x, int y) {
	int a = R[x];
	bool q = 0;
	for (int i = x+1; i != y; i = (i+1)%R.size()) {
		if (R[i] != a) {q = 1; break;}
	}
	if (!q) return (a ? -1 : 1);
	a = R[y+1];
	for (int i = y+1; i != x; i = (i+1)%R.size()) {
		if (R[i] != a) {q = 1; break;}
	}
	if (!q) return (a ? 1 : -1);
	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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