Submission #300565

#TimeUsernameProblemLanguageResultExecution timeMemory
300565CodePlatina식물 비교 (IOI20_plants)C++14
5 / 100
132 ms5112 KiB
#include "plants.h"

using namespace std;

int N;
vector<int> ps;

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

int compare_plants(int x, int y)
{
	int t = ps[y] - ps[x];
	if(t == 0) return 1;
	else if(t == y - x) return -1;
	t = ps[N] - t;
	if(t == 0) return -1;
	else if(t == N - y + x) return 1;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...