# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
103536 | 2019-03-31T10:53:31 Z | ekrem | Election (BOI18_election) | C++ | 3000 ms | 1520 KB |
#include <bits/stdc++.h> #define st first #define nd second #define mp make_pair #define pb push_back #define mod 1000000007 #define N 1000005 using namespace std; typedef long long ll; int n, q, bas, son, say, ans, u[N]; char s[N]; int main() { // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); scanf("%d %s %d",&n ,s + 1 ,&q); while(q--){ scanf("%d %d",&bas, &son); ans = say = 0; for(int i = bas; i <= son; i++){ if(s[i] == 'C') say++; else say--; if(say < 0){ ans++; say = 0; u[i] = 1; } else u[i] = 0; } say = 0; for(int i = son; i >= bas; i--){ if(u[i]) continue; if(s[i] == 'C') say++; else say--; if(say < 0){ say = 0; ans++; } } printf("%d\n", ans); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 384 KB | Output is correct |
2 | Correct | 10 ms | 384 KB | Output is correct |
3 | Correct | 7 ms | 384 KB | Output is correct |
4 | Correct | 9 ms | 384 KB | Output is correct |
5 | Correct | 8 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 384 KB | Output is correct |
2 | Correct | 10 ms | 384 KB | Output is correct |
3 | Correct | 7 ms | 384 KB | Output is correct |
4 | Correct | 9 ms | 384 KB | Output is correct |
5 | Correct | 8 ms | 384 KB | Output is correct |
6 | Execution timed out | 3032 ms | 1520 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 384 KB | Output is correct |
2 | Correct | 10 ms | 384 KB | Output is correct |
3 | Correct | 7 ms | 384 KB | Output is correct |
4 | Correct | 9 ms | 384 KB | Output is correct |
5 | Correct | 8 ms | 384 KB | Output is correct |
6 | Execution timed out | 3032 ms | 1520 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |