oj.uz

답안 #1091677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091677 2024-09-21T19:16:45 Z LucaLucaM Election (BOI18_election) C++17
28 / 100
 3000 ms 1356 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 = 0;
    std::string q = s;
    int sum = 0;
    for (int i = l; i <= r; i++) {
      if (s[i] == 'C') {
        sum++;
      } else {
        if (sum == 0) {
          answer++;
          q[i] = '-';
        } else {
          sum--;
        }
      }
    }
    sum = 0;
    for (int i = r; i >= l; i--) {
      if (q[i] == 'C') {
        sum++;
      } else if (q[i] == 'T') {
        // std::cout << debug(i) << debug(sum);
        if (sum == 0) {
          answer++;
        } else {
          sum--;
        }
      }
    }
    
    std::cout << answer << '\n';
  }

  return 0;
}

Compilation message

election.cpp:5:2: warning: #warning That's not the baby, that's my baby [-Wcpp]
    5 | #warning That's not the baby, that's my baby
      |  ^~~~~~~

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 484 KB Output is correct
5 Correct 3 ms 348 KB Output is correct

Subtask #2
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 484 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Execution timed out 3026 ms 1356 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 4 ms 484 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Execution timed out 3026 ms 1356 KB Time limit exceeded
7 Halted 0 ms 0 KB -