제출 #303319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303319		Utaha	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	384 KiB

plants

#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
int n,k;
vector<int> v;

void init(int _k, std::vector<int> r) {
	n = r.size();
	v = r;
	k = _k;
	return;
}

bool between(int idx,int l,int r){
	if(l<=idx&&idx<r) return 1;
	if(l<=idx+n&&idx+n<r) return 1;
	// cout<<idx<<' '<<l<<' '<<r<<endl;
	return 0;
}

int compare_plants(int x, int y) {
	if(between(y,x,x+k)){
		if(v[x]==0) return 1;
		else if(v[x] == k-1) return -1;
	}
	if(between(x,y,y+k)){
		if(v[y]==0) return -1;
		else if(v[y] == k-1) return 1;
	}
	return 0;
}

• Subtask 1: 0 / 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