Submission #1234613

#TimeUsernameProblemLanguageResultExecution timeMemory
1234613MuhammadSaram송신탑 (IOI22_towers)C++20
0 / 100
200 ms1560 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; #define all(v) v.begin(), v.end() vector<int> v; void init(int n, vector<int> a) { for (int i=1;i+1<n;i++) if (a[i]>a[i-1] && a[i]>a[i+1]) v.push_back(i); } int max_towers(int l, int r, int D) { l++,r--; int x=upper_bound(all(v),r)-lower_bound(all(v),l); return max(1,x); }
#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...