Submission #1096472

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1096472	2024-10-04T14:40:20 Z	Abito	Modern Machine (JOI23_ho_t5)	C++17	3 / 100	3000 ms	532 KB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=7005;
int n,m,q,a[N];
bool b[N];
int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	cin>>n>>m;
	for (int i=1;i<=n;i++){
		char c;cin>>c;
		if (c=='R') b[i]=1;
	}
	for (int i=1;i<=m;i++) cin>>a[i];
	cin>>q;
	while (q--){
		int l,r;
		cin>>l>>r;
		for (int i=l;i<=r;i++){
			int j=a[i];b[j]=1;
			while (j && j<=n){
				if (b[j]) b[j]=0,j++;
				else b[j]=1,j--;
			}
			/*for (int k=1;k<=n;k++){
				if (b[k]) cout<<'R';
				else cout<<'B';
			}cout<<endl;*/
		}int ans=0;
		for (int i=1;i<=n;i++) ans+=b[i];
		cout<<ans<<endl;
	}
	return 0;
}

Subtask #1

3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	5 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	5 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	43 ms	348 KB	Output is correct
11	Correct	210 ms	532 KB	Output is correct
12	Execution timed out	3011 ms	344 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	5 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	43 ms	348 KB	Output is correct
11	Correct	210 ms	532 KB	Output is correct
12	Execution timed out	3011 ms	344 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	464 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	464 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	464 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	5 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	43 ms	348 KB	Output is correct
11	Correct	210 ms	532 KB	Output is correct
12	Execution timed out	3011 ms	344 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-