# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161398 | Der_Vlapos | Modern Machine (JOI23_ho_t5) | C++20 | 3095 ms | 1352 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define pb push_back
const int BIG = 1e9 + 10;
#define int ll
struct test
{
void solve()
{
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i)
{
char x;
cin >> x;
a[i] = x == 'R';
}
vector<int> P(m);
for (int i = 0; i < m; ++i)
{
cin >> P[i];
P[i]--;
}
int q;
cin >> q;
auto bf = a;
for (int i = 0; i < q; ++i)
{
a = bf;
int l, r;
cin >> l >> r;
--l, --r;
for (int i = l; i <= r; ++i)
{
int p = P[i];
a[p] = 1;
int cntBf = 0;
while (p >= 0 and p < n)
{
if (a[p])
{
a[p] = 0;
p++;
}
else
{
a[p] = 1;
p--;
}
}
}
int cnt = 0;
for (int i = 0; i < n; ++i)
{
cnt += a[i];
}
cout << cnt << "\n";
}
}
};
main()
{
test t;
t.solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |