제출 #825116

#제출 시각아이디문제언어결과실행 시간메모리
825116alvingogo송신탑 (IOI22_towers)C++17
14 / 100
645 ms1876 KiB
#include "towers.h" #include <bits/stdc++.h> #define fs first #define sc second #define p_q priority_queue using namespace std; vector<int> v,pre; void init(int n, vector<int> h) { v=h; pre.resize(n); for(int i=1;i+1<n;i++){ if(v[i]<v[i-1] && v[i]<v[i+1]){ pre[i]=1; } } for(int i=1;i<n;i++){ pre[i]+=pre[i-1]; } } int max_towers(int l, int r, int d) { if(l==r){ return 1; } int u=pre[r-1]; if(l){ u-=pre[l]; } if(v[l]<v[l+1]){ u++; } if(v[r]<v[r-1]){ u++; } return u; }
#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...