제출 #1291815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291815		lucasdmy	Comparing Plants (IOI20_plants)	C++20	0 / 100	2 ms	1096 KiB

plants

#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2e5+10;
vector<int>v(MAXN, 0);
int sz;
void init(int k, vector<int>r){
    v[1]=r[0];
    sz=r.size();
    for(int i=2;i<=r.size();i++){
        v[i]=r[i-1]+v[i-1];
    }
	return;
}
int compare_plants(int x, int y){
    if(v[y-1]-v[x-1]==0){
        return 1;
    }else if(v[y-1]-v[x-1]==y-x){
        return -1;
    }else if(v[x-1]+v[sz]-v[y-1]==0){
        return -1;
    }else if(v[x-1]+v[sz]-v[y-1]==sz-y+x){
        return 1;
    }
	return 0;
}
/*int main(){
    int n;
    cin>>n;
    vector<int>v(n);
    for(int k=0;k<n;k++){
        cin>>v[k];
    }
    init(2, v);
    int a, b;
    for(int k=0;k<2;k++){
        cin>>a>>b;
        cout<<compare_plants(a+1, b+1);
    }
}*/

• 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