Submission #400152

#	Time	Username	Problem	Language	Result	Execution time	Memory
400152		kwongweng	Comparing Plants (IOI20_plants)	C++17	5 / 100	120 ms	8664 KiB

plants

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define F first
#define S second
ll INF = 1000000000;

const int N = 200001;
vi r, sum;
int n, k;
void init(int K, vi R) {
	n = R.size();
	r.resize(n); sum.resize(n+1);
	FOR(i, 0, n) r[i] = R[i];
	k = K;
	FOR(i, 1, n+1){
	    sum[i] = sum[i-1] + r[i-1];
	}
	
}

int compare_plants(int x, int y) {
    if (sum[y] - sum[x] == 0 || sum[x] + sum[n] - sum[y] == n + x - y) return 1;
    if (sum[y] - sum[x] == y - x || sum[x] + sum[n] - sum[y] == 0) 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