Submission #1081833

# Submission time Handle Problem Language Result Execution time Memory
1081833 2024-08-30T11:49:02 Z wood Comparing Plants (IOI20_plants) C++17
0 / 100
1 ms 440 KB
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>

vi pref;
int n;

void init(int k, std::vector<int> r) {
	n = r.size();
	pref.resize(n+1);
	for(int i = 0; i<n; i++)
		pref[i+1] = pref[i]+r[i];
}

int compare_plants(int x, int y) {
	int p = 1;
	if(x>y) {
		p = -1;
		swap(x,y);
	}
	if(pref[y]-pref[x+1]==0||pref[n]-pref[y]+pref[x]==n+x-y) return p;
	if(pref[y]-pref[x+1]==y-x-1||pref[n]-pref[y]+pref[x]==0) return -p;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 440 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 440 KB Output isn't correct
4 Halted 0 ms 0 KB -