# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
377385 | Thistle | Comparing Plants (IOI20_plants) | C++14 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "plants.h"
#include <vector>
#include<algorithm>
#include<set>
#include<iostream>
#include<random>
#include<queue>
#include<cassert>
using namespace std;
using ll=long long;
using H=pair<ll, ll>;
#define vec vector
#define vi vec<ll>
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define rng(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) rng((i),0,(n))
#define siz(a) int((a).size())
int n,all;
vec<int>csum;
void init(int k, std::vector<int> r) {
//DAG kouchiku
n=siz(r);
csum.assign(n,0);
rep(i,n) {
csum[i]=r[i];
all+=r[i];
}
rng(i,1,n) csum[i]+=csum[i-1];
return;
}
int sum(int l,int r){
return csum[r]-(l==0?0:csum[l-1]);
}
int compare_plants(int x, int y) {
if(sum(x,y-1)==0||all-sum(x,y-1)==(n-sum(x,y-1))){
return 1;
}
if(sum(x,y-1)==y-x||sum(x,y-1)==all){
return -1;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |