제출 #1182102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1182102		Zbyszek99	Modern Machine (JOI23_ho_t5)	C++20	3 / 100	3095 ms	840 KiB

Main

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int n,m;
string s;
vi A;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    cin >> n >> m >> s;
    s = "%"+s;
    A.resize(m+1,1);
    rep2(i,1,m) cin >> A[i];
    int q;
    cin >> q;
    rep(i,q)
    {
        int l,r;
        cin >> l >> r;
        string s2 = s;
        rep2(k,l,r)
        {
            int cur_poz = A[k];
         //   cout << cur_poz << " poz\n";
            s2[cur_poz] = 'R';
            while(cur_poz >= 1 && cur_poz <= n)
            {
         //       cout << cur_poz << " xd\n";
                if(s2[cur_poz] == 'R')
                {
                    s2[cur_poz] = 'B';
                    cur_poz++;
                }
                else
                {
                    s2[cur_poz] = 'R';
                    cur_poz--;
                }
            }
         //   cout << s2 << " s2\n";
        }
        int ans = 0;
        forall(it,s2) if(it == 'R') ans++;
        cout << ans << "\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