제출 #1015719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1015719		XJP12	Comparing Plants (IOI20_plants)	C++14	5 / 100	49 ms	10960 KiB

plants

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
vi v;
vi sum;
int n;
void init(int k, vector<int> r){
	n = r.size();
	//cout<<n<<endl;
	sum.resize(n,0);
	for(int i=0; i<n; i++){
		v.push_back(r[i]);
		sum[i]+=v[i];
		if(i>0) sum[i]+=sum[i-1];
		//cout<<sum[i]<<" ";
	}
//	cout<<endl;
}
int compare_plants(int x, int y){
	ll ans1=0, ans2=0;
	ans1=sum[y-1];
	//cout<<ans1<<ans2<<endl;
	if(x>0) ans1-=sum[x-1];
	ans2=sum[n-1]-ans1;
	//cout<<ans1<<ans2<<endl;
	if(ans1==y-x || ans2==0){
		return -1;
	}
	if(ans1==0 || ans2==n-y+x){
		return 1;
	}
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25