제출 #779332

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

plants

#include "plants.h"

#include <bits/stdc++.h>

using namespace std;

int n, k;
vector<int> bigger, smaller;

vector<int> pfs;



void init(int K, std::vector<int> r) {
	n = r.size();
	k = K;
	smaller.assign(n,0);
	bigger = r;

	for (int i = 0; i<n; i++) {
		smaller[i] = k-1-bigger[i];
	}

    pfs = {0};

    for (int i=0; i<n; i++) {
        pfs.push_back(pfs.back() + bigger[i]);
    }

	return;
}

int compare_plants(int x, int y) {
	int res = 0;

    int f;
    int ff;

    if (x<y) {
        f = pfs[y+1]-pfs[x];
        ff = y+1-x;
    }
    else {
        f = pfs[n]-pfs[x] + pfs[y+1];
        ff = n-x+y+1;
    }

    int s;
    int ss;

    if (y<x) {
        s = pfs[x+1]-pfs[y];
        ss = x+1-y;
    }
    else {
        s = pfs[n]-pfs[y] + pfs[x+1];
        ss = n-y+x+1;
    }


    if (f == 0) res = 1;
    if (f == ff) res = -1;
    if (s == 0) res = -1;
    if (s == ss) res = 1;

	return res;
}

• 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