Submission #878473

# Submission time Handle Problem Language Result Execution time Memory
878473 2023-11-24T13:36:45 Z phoenix0423 Modern Machine (JOI23_ho_t5) C++17
3 / 100
3000 ms 1372 KB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define f first
#define s second
const int INF = 1e9;
const int maxn = 2e5 + 5;

int main(void){
	fastio;
	int n, m;
	cin>>n>>m;
	vector<int> org(n), c(n);
	string s;
	cin>>s;
	REP(i, n) {
		org[i] = (s[i] == 'R');
	}
	vector<int> a(m);
	REP(i, m) cin>>a[i], a[i] --;
	auto play = [&](int pos) -> void{
		c[pos] = 1;
		while(pos >= 0 && pos < n){
			c[pos] ^= 1;
			if(c[pos]) pos--;
			else pos++;
		}
	};
	int q;
	cin>>q;
	while(q--){
		int l, r;
		cin>>l>>r;
		l--, r--;
		c = org;
		for(int i = l; i <= r; i++) play(a[i]);
		int cnt = 0;
		REP(i, n) if(c[i]) cnt++;
		cout<<cnt<<"\n";
	}
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 52 ms 348 KB Output is correct
11 Correct 270 ms 556 KB Output is correct
12 Execution timed out 3039 ms 348 KB Time limit exceeded
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 52 ms 348 KB Output is correct
11 Correct 270 ms 556 KB Output is correct
12 Execution timed out 3039 ms 348 KB Time limit exceeded
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3053 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3053 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 3053 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 7 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 52 ms 348 KB Output is correct
11 Correct 270 ms 556 KB Output is correct
12 Execution timed out 3039 ms 348 KB Time limit exceeded
13 Halted 0 ms 0 KB -