oj.uz

답안 #789077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789077 2023-07-21T02:10:43 Z Genius3435 Election (BOI18_election) C++17
28 / 100
 3000 ms 1204 KB 
#include <bits/stdc++.h>
using namespace std;

int constexpr N = 1<<19;
int upd[N];
char s[N];

int main() {
    int n; cin >> n >> s;
    int q; cin >> q;
    for (int qi = 1; qi <= q; ++qi) {
        int l, r; cin >> l >> r; --l;

        int ans = 0, c = 0;
        for (int i = l; i < r; ++i) {
            c += s[i] == 'C' ? 1 : -1;
            if (c < 0) {
                upd[i] = qi;
                c += 1;
                ans += 1;
            }
        }
        c = 0;
        for (int i = r-1; i >= l; --i) {
            c += s[i] == 'C' ? 1 : -1;
            c += upd[i] == qi;
            if (c < 0) {
                upd[i] = qi;
                c += 1;
                ans += 1;
            }
        }

        cout << ans << '\n';
    }
}

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 9 ms 324 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 5 ms 316 KB Output is correct

Subtask #2
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 9 ms 324 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 5 ms 316 KB Output is correct
6 Execution timed out 3071 ms 1204 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 340 KB Output is correct
2 Correct 9 ms 324 KB Output is correct
3 Correct 7 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 5 ms 316 KB Output is correct
6 Execution timed out 3071 ms 1204 KB Time limit exceeded
7 Halted 0 ms 0 KB -