Submission #1041792

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041792		MarwenElarbi	Comparing Plants (IOI20_plants)	C++17	0 / 100	37 ms	13564 KiB

plants

    #include <bits/stdc++.h>
    #include "plants.h"
    using namespace std;
    const int nax=2e5+5;
    int mx[nax];
    int mn[nax];
    int n;
    void init(int k, std::vector<int> r) {
    	n=r.size();
    	for (int i = 0; i < n*2; ++i)
    	{
    		mx[i]=i;
    		mn[i]=i;
    	}
    	for (int i = 0; i < n*2; ++i)
    	{
    		if(r[i%n]==0){
    			mn[i+1]=mn[i];
    		}else{
    			mx[i+1]=mx[i];
    		}
    	}
    	return;
    }
     
    int compare_plants(int x, int y) {
    	if(mx[y]<=x){
    		return -1;
    	}else if(mn[y]<=x){
    		return 1;
    	}else if(mx[x+n]<=y){
    		return 1;
    	}else if(mn[x+n]<=y){
    		return -1;
    	}else 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