# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
937849 | 2024-03-04T15:24:23 Z | sleepntsheep | Election (BOI18_election) | C | 2 ms | 2392 KB |
#include<stdio.h> int lo(int a, int b) { return a<b?a:b; } #define N 500000 int n, q; char s[N+1]; int go[N],bk[N]; int f(char c) { return c == 'C' ? 1 : -1; } int main() { scanf("%d%s%d", &n, s, &q); go[0] = f(s[0]); bk[n-1] = f(s[n-1]); for (int i = 1; i < n; ++i) go[i] = go[i-1] + f(s[i]); for (int i = n - 2; i >= 0; --i) bk[i] = bk[i+1] + f(s[i]); for (int x, y, i = 0; i < q; ++i) { scanf("%d%d", &x, &y); --x, --y; int o1 = (x ? go[x-1] : 0), o2 = (y + 1 < n ? bk[y+1] : 0); int z = lo(go[x] - o1, bk[x] - o2); for (int i = x + 1; i <= y; ++i) z = lo(z, lo(go[i] - o1, bk[i] - o2)); printf("%d\n", -z); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2392 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2392 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2392 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |