oj.uz

Submission #411162

# Submission time Handle Problem Language Result Execution time Memory
411162 2021-05-24T12:40:25 Z eagle30 Comparing Plants (IOI20_plants) C++14
0 / 100
 1 ms 204 KB 
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
int pref[1000000], n, tot=0;
void init(int k, vector<int> r) {
	n=r.size();
	for(int i=0; i<n; i++){
		tot+=r[i];
		pref[i+1]=tot;
	}
	return;
}

int compare_plants(int x, int y) {
	int u=pref[y]-pref[x];
	if(u==y-x || tot==u){
		return -1;
	}
	else if(u==0 || tot-u==y-x){
		return 1;
	}
	else{
		return 0;
	}
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 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 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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