제출 #260537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
260537		WLZ	Linear Garden (IOI08_linear_garden)	C++14	95 / 100	22 ms	10268 KiB

linear_garden

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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  long long MOD;
  string s;
  cin >> n >> MOD >> s;
  vector<long long> pw(n + 1);
  pw[0] = 1;
  for (int i = 1; i <= n; i++) {
    pw[i] = (pw[i - 1] * 2) % MOD;
  }
  long long ans = 0;
  int lo = 0, hi = 0, cur = 0;
  int k = n;
  for (auto& c : s) {
    k--;
    if (c == 'P') {
      int tmp = cur + 1;
      int tmp_lo = min(lo, tmp);
      int tmp_hi = max(hi, tmp);
      if (tmp_hi - tmp_lo == 2) {
        if (tmp == (tmp_hi + tmp_lo) / 2) {
          ans = (ans + pw[(k + 1) / 2]) % MOD;
        } else {
          ans = (ans + pw[k / 2]) % MOD;
        }
      } else if (tmp_hi - tmp_lo == 1) {
        ans = ((ans + pw[k / 2] + pw[(k + 1) / 2] - 1) % MOD + MOD) % MOD; 
      }
    }
    if (c == 'L') {
      cur++;
    } else {
      cur--;
    }
    lo = min(lo, cur);
    hi = max(hi, cur);
  }
  cout << ans + 1 << '\n';
  return 0;
}

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 4 / 4
• Subtask 7: 4 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 4 / 4
• Subtask 11: 4 / 4
• Subtask 12: 0 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 5 / 5