結果

問題 No.259 セグメントフィッシング＋
ユーザー fumiphysfumiphys
提出日時 2019-10-18 01:50:31
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,382 bytes
コンパイル時間 1,545 ms
コンパイル使用メモリ 169,340 KB
実行使用メモリ 5,512 KB
最終ジャッジ日時 2023-09-07 19:52:48
合計ジャッジ時間 7,137 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll cntr[5010], cntl[5010];
ll tmpr[5010], tmpl[5010];

int main(int argc, char const* argv[])
{
  int n, q; cin >> n >> q;
  vector<char> c(q);
  vector<ll> t(q), L(q), R(q); rep(i, q)cin >> c[i] >> t[i] >> L[i] >> R[i];
  if(n <= 5000){
    rep(i, q){
      ll T = (t[i] - (i > 0 ? t[i-1]: 0));
      T %= (2 * n);
      rep(j, n)tmpl[j] = 0;
      rep(j, n)tmpr[j] = 0;
      rep(j, n){
        int idx = j - T;
        bool l = true;
        if(T < n){
          if(idx < 0){
            idx = - idx - 1;
            l = false;
          }
        }else{
          idx = 2 * n - T + idx;
          if(idx >= n){
            l = false;
            idx = n - (1 + idx - n);
          }
        }
        if(l)tmpl[idx] += cntl[j];
        else tmpr[idx] += cntl[j];
      }
      rep(j, n){
        int idx = j + T;
        bool r = true;
        if(T < n){
          if(idx >= n){
            r = false;
            idx = n - (1 + idx - n);
          }
        }else{
          idx = idx - 2 * n + T;
          if(idx < 0){
            r = false;
            idx = - idx - 1;
          }
        }
        if(r)tmpr[idx] += cntr[j];
        else tmpl[idx] += cntr[j];
      }
      swap(cntr, tmpr);
      swap(cntl, tmpl);
      if(c[i] == 'L')cntl[L[i]] += R[i];
      else if(c[i] == 'R')cntr[L[i]] += R[i];
      else {
        ll res = 0;
        FOR(j, L[i], R[i]){
          res += cntl[j] + cntr[j];
        }
        cout << res << endl;
      }
    }
  }else{
    assert(false);
  }
  return 0;
}
0