제출 #878473

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
878473		phoenix0423	Modern Machine (JOI23_ho_t5)	C++17	3 / 100	3053 ms	1372 KiB

Main

#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";
	}
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 12
• Subtask 3: 0 / 10
• Subtask 4: 0 / 11
• Subtask 5: 0 / 26
• Subtask 6: 0 / 17
• Subtask 7: 0 / 21