Submission #306512

#	Time	Username	Problem	Language	Result	Execution time	Memory
306512		giorgikob	Comparing Plants (IOI20_plants)	C++14	0 / 100	80 ms	3448 KiB

plants

#include "plants.h"

#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;

const int N = 5e5;

vector<int>v;
int n;
int R[N], L[N];

void init(int k, std::vector<int> r) {
    n = r.size();
    int a = 0;
    for(int i = 0; i < n; i++){
        if(a < i) a = i;
        while(r[a] == 0) a++;
        R[i] = a;
    }

    int b = n-1;
    for(int i = n-1; i >= 0; i--){
        if(b > i) b = i;
        while(r[(b-1+n) % n] == 1) b --;
        L[i] = b;
    }

	return;
}

bool check(int x,int y){
    return (L[x] <= y && y <= R[x]) ||
           (L[x] <= y-n && y-n <= R[x]);
}
int compare_plants(int x, int y) {
    if(check(x,y)) return 1;
    if(check(y,x)) 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