oj.uz

Submission #869506

# Submission time Handle Problem Language Result Execution time Memory
869506 2023-11-04T14:40:53 Z tch1cherin Street Lamps (APIO19_street_lamps) C++17
20 / 100
 57 ms 3548 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, Q;
  string S;
  cin >> N >> Q >> S;
  if (N <= 100 && Q <= 100) {
    vector<string> states = {S};
    while (Q--) {
      string T;
      cin >> T;
      if (T == "toggle") {
        int P;
        cin >> P;
        P--;
        S[P] ^= 1;
      } else {
        int L, R;
        cin >> L >> R;
        L--, R--;
        int ans = 0;
        for (auto value : states) {
          ans += value.substr(L, R - L) == string(R - L, '1');
        }
        cout << ans << "\n";
      }
      states.push_back(S);
    }
  } else {
    vector<int> sum(N), last(N), par(N);
    for (int i = 0; i < N; i++) {
      par[i] = S[i] - '0';
    }
    for (int i = 1; i <= Q; i++) {
      string T;
      cin >> T;
      if (T == "toggle") {
        int P;
        cin >> P;
        P--;
        if (par[P] == 1) {
          sum[P] += i - last[P];
          par[P] ^= 1;
          last[P] = i;
        }
      } else {
        int L, R;
        cin >> L >> R;
        L--, R--;
        int ans = sum[L];
        if (par[L] == 1) {
          ans += i - last[L];
        }
        cout << ans << "\n";
      }
    }
  }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 3548 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 57 ms 3548 KB Output isn't correct
9 Halted 0 ms 0 KB -