Submission #836565

#TimeUsernameProblemLanguageResultExecution timeMemory
836565tengiz05송신탑 (IOI22_towers)C++17
0 / 100
9 ms1744 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; vector<int> h; int n; vector<int> a; void init(int N, vector<int> H) { n = N; h = H; a.resize(n); for (int i = 1; i < n - 1; i++) { if ((h[i - 1] < h[i]) != (h[i] < h[i + 1])) { a[i]++; } } for (int i = 1; i < n; i++) { a[i] += a[i - 1]; } } int max_towers(int l, int r, int D) { if (l == r) { return 1; } int sum = a[r - 1] - a[l]; cout << sum << "\n"; if (h[l] > h[l + 1]) { sum--; } return max(1, (sum + 3) / 2); }
#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...