Submission #835575

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
835575	2023-08-23T16:13:54 Z	rubdary	Comparing Plants (IOI20_plants)	C++14	5 / 100	65 ms	8280 KB

plants

#include "plants.h"
#include <iostream>
using namespace std;
int N;
vector <int> sum;

void init(int k, vector<int> r){
	sum.push_back(0);
	for(int i = 0; i < r.size(); i++){
		sum.push_back(sum.back()+r[i]);
	}
	return;
}

int lower(int x, int y){
	int suma = sum[y] - sum[x];
	int cant = y - x;
	if(suma == 0) return 1;
	if(suma == cant) return -1;
	suma = (sum.back() - sum[y]) + (sum[x]);
	cant = N - cant;
	if(suma == 0) return -1;
	if(suma == cant) return 1;
	return 0;
}
int higher(int x, int y){
	int suma = sum[x] - sum[y];
	int cant = x - y;
	if(suma == 0) return -1;
	if(suma == cant) return 1;
	suma = (sum.back() - sum[x]) + (sum[y]);
	cant = N - cant;
	if(suma == 0) return 1;
	if(suma == cant) return -1;
	return 0;
}

int compare_plants(int x, int y){
	N = sum.size()-1;
	if(x < y) return lower(x, y); 
	return higher(x, y);
}

Compilation message

plants.cpp: In function 'void init(int, std::vector<int>)':
plants.cpp:9:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i = 0; i < r.size(); i++){
      |                 ~~^~~~~~~~~~

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	300 KB	Output is correct
6	Correct	38 ms	4052 KB	Output is correct
7	Correct	43 ms	5460 KB	Output is correct
8	Correct	58 ms	8248 KB	Output is correct
9	Correct	59 ms	8252 KB	Output is correct
10	Correct	56 ms	8260 KB	Output is correct
11	Correct	65 ms	8236 KB	Output is correct
12	Correct	60 ms	8280 KB	Output is correct
13	Correct	54 ms	8240 KB	Output is correct
14	Correct	54 ms	8256 KB	Output is correct

Subtask #2

0 / 14.0

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

Subtask #3

0 / 13.0

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

Subtask #4

0 / 17.0

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

Subtask #6

0 / 15.0

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

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	260 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	300 KB	Output is correct
6	Correct	38 ms	4052 KB	Output is correct
7	Correct	43 ms	5460 KB	Output is correct
8	Correct	58 ms	8248 KB	Output is correct
9	Correct	59 ms	8252 KB	Output is correct
10	Correct	56 ms	8260 KB	Output is correct
11	Correct	65 ms	8236 KB	Output is correct
12	Correct	60 ms	8280 KB	Output is correct
13	Correct	54 ms	8240 KB	Output is correct
14	Correct	54 ms	8256 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Incorrect	1 ms	212 KB	Output isn't correct
18	Halted	0 ms	0 KB	-