Submission #1267373

#TimeUsernameProblemLanguageResultExecution timeMemory
1267373Faggi송신탑 (IOI22_towers)C++20
14 / 100
256 ms2332 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll n; vector<int>h; vector<ll>v; void init(int N, std::vector<int> H) { h=H; v.resize(N,0); n=N; ll i; for(i=1; i<N; i++) { v[i]=v[i-1]; if(i+1<N&&H[i]<H[i+1]&&H[i]<H[i-1]) v[i]++; } } int max_towers(int L, int R, int D) { if(L==R) return 1; int ans=v[R-1]-v[L]; if(h[L]<h[L+1]) ans++; if(h[R]<h[R-1]) ans++; return ans; }
#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...