#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve()
{
int n, q;
cin >> n >> q;
vector<array<int, 2> > a(n + 1, {0, -1}); // alr occurred, start pos (start pos = -1 if off)
string s;
cin >> s;
for(int i = 0; i < n; i++)
{
if(s[i] == '1')
{
a[i] = {0, 0};
}
}
for(int i = 1; i <= q; i++)
{
string command;
cin >> command;
if(command == "query")
{
int x, y;
cin >> x >> y;
x--, y--;
int ans = a[x][0];
if(a[x][1] != -1) ans += (i - a[x][1]);
cout << ans << "\n";
}
else
{
int idx;
cin >> idx;
idx--;
if(a[idx][1] == -1)
{
a[idx][1] = i;
}
else
{
a[idx][0] += (i - a[idx][1]);
a[idx][1] = -1;
}
}
}
}
int32_t main()
{
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
for(int i = 1; i <= t; i++)
{
//cout << "Case #" << i << ": ";
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
66 ms |
2100 KB |
Output is correct |
2 |
Correct |
68 ms |
4124 KB |
Output is correct |
3 |
Correct |
69 ms |
5284 KB |
Output is correct |
4 |
Correct |
113 ms |
11136 KB |
Output is correct |
5 |
Correct |
132 ms |
11628 KB |
Output is correct |
6 |
Correct |
84 ms |
10916 KB |
Output is correct |
7 |
Correct |
110 ms |
11716 KB |
Output is correct |
8 |
Correct |
119 ms |
13156 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |