제출 #1320053

#제출 시각아이디문제언어결과실행 시간메모리
1320053BigBadBully송신탑 (IOI22_towers)C++20
14 / 100
268 ms1812 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; int n; vector<int> v,pref; bool check(int i) { return ((i==0 || v[i] < v[i-1])&&(i==n-1 || v[i] < v[i+1])); } void init(int N, std::vector<int> H) { v = H; n = N; pref.resize(n,0); for(int i = 0; i < n; i++) pref[i] = (i>0?pref[i-1]:0)+check(i); } int max_towers(int l, int r, int d) { if(l==r)return 1; int a = (v[l] < v[l+1]); int b = (v[r]<v[r-1]); return pref[r]-(l>0?pref[l-1]:0) - check(l)- check(r)+a+b; }
#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...