제출 #791124

#제출 시각아이디문제언어결과실행 시간메모리
791124alexander707070식물 비교 (IOI20_plants)C++14
0 / 100
1 ms212 KiB
#include<bits/stdc++.h> #define MAXN 200007 using namespace std; int n,perm[MAXN],k,minpos,maxpos; int pref[MAXN],sum,inv; void init(int K,vector<int> R){ n=int(R.size()); k=K; for(int i=0;i<n;i++){ pref[i+1]=R[i]; pref[i+1]+=pref[i]; sum+=R[i]; } } int compare_plants(int x, int y){ if(x>y){ swap(x,y); inv=-1; }else{ inv=1; } x++; y++; if(pref[y-1]-pref[x-1]==0)return -1*inv; if(pref[y-1]-pref[x-1]==y-x)return 1*inv; if(sum-(pref[y-1]-pref[x-1])==0)return -1*inv; if(sum-(pref[y-1]-pref[x-1])==n-(y-x))return 1*inv; return 0; } /* int main(){ init(1,{1,0,0,1,0,0}); cout<<compare_plants(0,4)<<"\n"; cout<<compare_plants(1,3)<<"\n"; } */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...