Submission #986375

#	Time	Username	Problem	Language	Result	Execution time	Memory
986375		cig32	Modern Machine (JOI23_ho_t5)	C++17	11 / 100	309 ms	180048 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
static void run_with_stack_size(void (*func)(void), size_t stsize) {
  char *stack, *send;
  stack = (char *)malloc(stsize);
  send = stack + stsize - 16;
  send = (char *)((uintptr_t)send / 16 * 16);
  asm volatile(
    "mov %%rsp, (%0)\n"
    "mov %0, %%rsp\n"
    :
    : "r"(send));
  func();
  asm volatile("mov (%0), %%rsp\n" : : "r"(send));
  free(stack);
} 
int n, m, q;
char c[MAXN];
int a[MAXN];
int r[MAXN], b[MAXN];

int f(int prefix, int pivot) {
  char upd[n+1];
  for(int i=1; i<=n; i++) upd[i] = (i <= prefix ? 'R' : 'B');
  int leftR = 0, rightB = 0;
  for(int j=1; j<=n; j++) {
    if(j < pivot) leftR += (upd[j] == 'R');
    if(j > pivot) rightB += (upd[j] == 'B');
  }
  if(rightB <= leftR) { // goes to the right
    int cnt = 0;
    for(int j=pivot-1; j>=1; j--) {
      cnt += (upd[j] == 'R');
      if(cnt == rightB) {
        for(int k=j; k<=n; k++) upd[k] = 'B';
        break;
      }
    }
    if(rightB == 0) {
      for(int j=pivot; j<=n; j++) upd[j] = 'B';
    }
  }
  else {
    int cnt = 0;
    for(int j=pivot+1; j<=n; j++) {
      cnt += (upd[j] == 'B');
      if(cnt == leftR + 1) {
        for(int k=j; k>=1; k--) upd[k] = 'R';
        break;
      }
    }
  }
  int ans = 0;
  for(int i=1; i<=n; i++) ans += (upd[i] == 'R');
  return ans;
}
void solve(int tc) {
  cin >> n >> m;
  for(int i=1; i<=n; i++) cin >> c[i];
  for(int i=1; i<=m; i++) cin >> a[i];
  int st[17][m+1][n+1];
  for(int i=0; i<=n; i++) {
    for(int j=1; j<=m; j++) {
      st[0][j][i] = f(i, a[j]);
    }
  }
  for(int i=1; i<17; i++) {
    for(int j=1; j+(1<<i)-1<=m; j++) {
      for(int k=0; k<=n; k++) {
        int bru = st[i-1][j][k];
        int now = j + (1<<(i-1));
        st[i][j][k] = st[i-1][now][bru];
      }
    }
  }
  cin >> q;
  while(q--) {
    int l, r;
    cin >> l >> r;
    int bru = n;
    for(int i=16; i>=0; i--) {
      if(l + (1 << i) - 1 <= r) {
        bru = st[i][l][bru];
        l += (1 << i);
      }
    }
    cout << bru << "\n";
  }


}
void uwu() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
int32_t main() {
  #ifdef ONLINE_JUDGE
  uwu();
  #endif
  #ifndef ONLINE_JUDGE
  run_with_stack_size(uwu, 1024 * 1024 * 1024); // run with a 1 GiB stack
  #endif
}
/*
g++ C.cpp -std=c++17 -O2 -o C
./C < input.txt

*/

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