# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1091698 | 2024-09-21T20:06:30 Z | LucaLucaM | Election (BOI18_election) | C++17 | 3000 ms | 1872 KB |
#include <iostream> #include <vector> #include <algorithm> #include <cassert> #warning That's not the baby, that's my baby #define debug(x) #x << " = " << x << '\n' using ll = long long; const int INF = 1e9; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0); #ifdef LOCAL freopen("input.txt", "r", stdin); #endif int n; std::cin >> n; std::string s; std::cin >> s; s = '$' + s; std::vector<int> pref(n + 1, 0); for (int i = 1; i <= n; i++) { if (s[i] == 'C') { pref[i] = pref[i - 1] + 1; } else { pref[i] = pref[i - 1] - 1; } } int q; std::cin >> q; while (q--) { int l, r; std::cin >> l >> r; int answer = INF; int mini = INF; for (int i = l - 1; i <= r; i++) { mini = std::min(mini, pref[i] - pref[l - 1]); answer = std::min(answer, pref[r] - pref[i] + mini); } std::cout << -answer << '\n'; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 348 KB | Output is correct |
2 | Correct | 2 ms | 348 KB | Output is correct |
3 | Correct | 2 ms | 348 KB | Output is correct |
4 | Correct | 2 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 348 KB | Output is correct |
2 | Correct | 2 ms | 348 KB | Output is correct |
3 | Correct | 2 ms | 348 KB | Output is correct |
4 | Correct | 2 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1183 ms | 1872 KB | Output is correct |
7 | Execution timed out | 3032 ms | 1872 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 348 KB | Output is correct |
2 | Correct | 2 ms | 348 KB | Output is correct |
3 | Correct | 2 ms | 348 KB | Output is correct |
4 | Correct | 2 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1183 ms | 1872 KB | Output is correct |
7 | Execution timed out | 3032 ms | 1872 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |