Submission #788581

#TimeUsernameProblemLanguageResultExecution timeMemory
788581mosiashvililukaRadio Towers (IOI22_towers)C++17
4 / 100
763 ms1488 KiB
#include<bits/stdc++.h> #include "towers.h" using namespace std; int a,b,c,d,e,i,j,ii,jj,zx,xc,f[100009],K,pas,L,R,D; void init(int NN, std::vector<int> HH) { a=NN; for(i=1; i<=a; i++){ f[i]=HH[i-1]; } K=1; for(i=1; i<=a; i++){ if(f[K]<f[i]) K=i; } } int max_towers(int LL, int RR, int DD) { pas=1;LL++;RR++; L=LL;R=RR;D=DD; if(L<K&&K<R){ if(max(f[L],f[R])<=f[K]-D){ pas=2; } } return pas; }
#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...