# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
852987 |
2023-09-23T09:55:36 Z |
faruk |
Election (BOI18_election) |
C++17 |
|
3000 ms |
920 KB |
#include <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int get(string s) {
int n = s.size();
vector<bool> nulli(n);
int bal = 0;
for (int i = 0; i < n; i++) {
if (nulli[i])
continue;
if (bal == 0 and s[i] == 'T')
nulli[i] = true;
else if (s[i] == 'T')
bal--;
else
bal++;
}
bal = 0;
for (int i = n - 1; i >= 0; i--) {
if (nulli[i])
continue;
if (bal == 0 and s[i] == 'T')
nulli[i] = true;
else if (s[i] == 'T')
bal--;
else
bal++;
}
return count(all(nulli), true);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >>s;
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r; r--, l--;
cout << get(s.substr(l, r - l + 1)) << "\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
348 KB |
Output is correct |
2 |
Correct |
6 ms |
344 KB |
Output is correct |
3 |
Correct |
5 ms |
348 KB |
Output is correct |
4 |
Correct |
6 ms |
600 KB |
Output is correct |
5 |
Correct |
5 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
348 KB |
Output is correct |
2 |
Correct |
6 ms |
344 KB |
Output is correct |
3 |
Correct |
5 ms |
348 KB |
Output is correct |
4 |
Correct |
6 ms |
600 KB |
Output is correct |
5 |
Correct |
5 ms |
344 KB |
Output is correct |
6 |
Execution timed out |
3044 ms |
920 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
348 KB |
Output is correct |
2 |
Correct |
6 ms |
344 KB |
Output is correct |
3 |
Correct |
5 ms |
348 KB |
Output is correct |
4 |
Correct |
6 ms |
600 KB |
Output is correct |
5 |
Correct |
5 ms |
344 KB |
Output is correct |
6 |
Execution timed out |
3044 ms |
920 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |