Submission #1239578

#TimeUsernameProblemLanguageResultExecution timeMemory
1239578MuhammadSaram식물 비교 (IOI20_plants)C++20
0 / 100
0 ms328 KiB
#include "plants.h"
#include <bits/stdc++.h>

using namespace std;

const int M = 2e5 + 1;

int pre[M], n;

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

int compare_plants(int x, int y)
{
	int len=y-x, val = pre[y]-pre[x];
	if (val%len)
	{
		val=pre[n]-val, val=n-len;
		if (val%len) return 0;
		return (val==len?1:-1);
	}
	return (val==len?-1:1);
}
#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...