Submission #931529

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
931529	2024-02-22T02:40:21 Z	pcc	Modern Machine (JOI23_ho_t5)	C++14	3 / 100	3000 ms	1372 KB

Main

#include <bits/stdc++.h>
using namespace std;

const int mxn = 2e5+10;

int N,M,Q,op[mxn];
string s;

void calc(int now){
	s[now] = 'R';
	while(now>=1&&now<=N){
		if(s[now] == 'R'){
			s[now] = 'B';
			now++;
		}
		else{
			s[now] = 'R';
			now--;
		}
	}
	return;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>M;
	cin>>s;
	for(int i = 1;i<=M;i++)cin>>op[i];
	s = "#"+s;
	string ss = s;
	cin>>Q;
	while(Q--){
		int l,r;
		cin>>l>>r;
		s = ss;
		for(int i = l;i<=r;i++)calc(op[i]);
		int ans = 0;
		for(int i = 1;i<=N;i++)if(s[i] == 'R')ans++;
		cout<<ans<<'\n';
	}
	return 0;
}

Subtask #1

3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	7 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	348 KB	Output is correct
2	Correct	0 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	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	7 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	66 ms	516 KB	Output is correct
11	Correct	281 ms	344 KB	Output is correct
12	Execution timed out	3031 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	348 KB	Output is correct
2	Correct	0 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	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	7 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	66 ms	516 KB	Output is correct
11	Correct	281 ms	344 KB	Output is correct
12	Execution timed out	3031 ms	344 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	3063 ms	1372 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	3063 ms	1372 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Execution timed out	3063 ms	1372 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #7

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 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	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	7 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	66 ms	516 KB	Output is correct
11	Correct	281 ms	344 KB	Output is correct
12	Execution timed out	3031 ms	344 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-