Submission #29730168
Source Code Expand
n, q = map(int, input().split())
s = input()
a = [0] * (n - 1)
for i in range(n - 1):
if s[i : i + 2] == "AC":
a[i] = 1
t = [0] * n
for i in range(1, n):
t[i] = t[i - 1] + a[i - 1]
for i in range(q):
l, r = map(int, input().split())
l -= 1
r -= 1
print(t[r] - t[l])
Submission Info
| Submission Time | |
|---|---|
| Task | C - GeT AC |
| User | Pro_ktmr |
| Language | PyPy3 (7.3.0) |
| Score | 300 |
| Code Size | 310 Byte |
| Status | AC |
| Exec Time | 420 ms |
| Memory | 77552 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | a01 |
| All | a01, b02, b03, b04, b05, b06, b07, b08, b09, b10, b11, b12 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| a01 | AC | 107 ms | 61564 KiB |
| b02 | AC | 49 ms | 61536 KiB |
| b03 | AC | 406 ms | 77112 KiB |
| b04 | AC | 401 ms | 76960 KiB |
| b05 | AC | 417 ms | 77364 KiB |
| b06 | AC | 395 ms | 77004 KiB |
| b07 | AC | 404 ms | 77128 KiB |
| b08 | AC | 403 ms | 76948 KiB |
| b09 | AC | 420 ms | 77096 KiB |
| b10 | AC | 402 ms | 77552 KiB |
| b11 | AC | 406 ms | 77204 KiB |
| b12 | AC | 404 ms | 77128 KiB |