#139785 (C++14) No.469 区間加算と一致検索の問題

• 問題: No.469 区間加算と一致検索の問題
• ユーザー: koyumeishi
• 提出日時: 2016-12-19 00:25:59
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 207 ms / 5,000 ms
• コード長: 4,506 bytes
• コンパイル時間: 1,135 ms
• コンパイル使用メモリ: 117,516 KB
• 実行使用メモリ: 36,056 KB
• 最終ジャッジ日時: 2023-08-23 13:18:35
• 合計ジャッジ時間: 7,457 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	1 ms; 4,376 KB
testcase_02	AC	4 ms; 5,572 KB
testcase_03	AC	7 ms; 4,376 KB
testcase_04	AC	8 ms; 4,376 KB
testcase_05	AC	9 ms; 4,376 KB
testcase_06	AC	10 ms; 4,376 KB
testcase_07	AC	11 ms; 4,376 KB
testcase_08	AC	12 ms; 4,380 KB
testcase_09	AC	6 ms; 4,380 KB
testcase_10	AC	9 ms; 4,376 KB
testcase_11	AC	4 ms; 4,376 KB
testcase_12	AC	13 ms; 4,380 KB
testcase_13	AC	9 ms; 4,376 KB
testcase_14	AC	3 ms; 4,376 KB
testcase_15	AC	5 ms; 4,380 KB
testcase_16	AC	11 ms; 4,380 KB
testcase_17	AC	10 ms; 4,380 KB
testcase_18	AC	11 ms; 4,376 KB
testcase_19	AC	3 ms; 4,376 KB
testcase_20	AC	12 ms; 4,380 KB
testcase_21	AC	4 ms; 4,376 KB
testcase_22	AC	2 ms; 4,380 KB
testcase_23	AC	76 ms; 8,176 KB
testcase_24	AC	75 ms; 8,220 KB
testcase_25	AC	76 ms; 8,012 KB
testcase_26	AC	77 ms; 8,112 KB
testcase_27	AC	76 ms; 8,128 KB
testcase_28	AC	77 ms; 8,016 KB
testcase_29	AC	76 ms; 8,052 KB
testcase_30	AC	76 ms; 8,128 KB
testcase_31	AC	77 ms; 8,128 KB
testcase_32	AC	80 ms; 8,332 KB
testcase_33	AC	200 ms; 36,056 KB
testcase_34	AC	204 ms; 36,020 KB
testcase_35	AC	205 ms; 35,768 KB
testcase_36	AC	202 ms; 35,652 KB
testcase_37	AC	207 ms; 35,816 KB
testcase_38	AC	188 ms; 34,292 KB
testcase_39	AC	195 ms; 34,272 KB
testcase_40	AC	191 ms; 34,232 KB
testcase_41	AC	195 ms; 34,168 KB
testcase_42	AC	200 ms; 34,308 KB
testcase_43	AC	193 ms; 34,184 KB
testcase_44	AC	190 ms; 34,444 KB
testcase_45	AC	187 ms; 34,280 KB
testcase_46	AC	193 ms; 34,232 KB
testcase_47	AC	189 ms; 34,180 KB
testcase_48	AC	2 ms; 4,376 KB
testcase_49	AC	1 ms; 4,380 KB
testcase_50	AC	190 ms; 34,064 KB
testcase_51	AC	190 ms; 34,176 KB

ソースコード

#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod1 = 9_ten + 7;
constexpr long long mod2 = 9_ten + 9;
constexpr long long mod3 = 1000000021;

#include <tuple>

int main(){
  int n,q;
  cin >> n,q;

  long long p1 = 10007;
  long long p2 = 10009;
  long long p3 = 114514;

  vector<long long> x(n+10, 1);
  vector<long long> y(n+10, 1);
  vector<unsigned long long> z(n+10, 1);
  for(auto i : range(1,n+10) ){
    x[i] = x[i-1] * p1 % mod1;
    y[i] = y[i-1] * p2 % mod2;
    z[i] = z[i-1] * p3 % mod3;
  }

  map<tuple<long long,long long,long long>, int> memo;
  vector<tuple<long long,long long,long long>> hash(q+1);

  memo[hash[0]] = 0;
  for(int i=0; i<q; i++){
    string s;
    cin >> s;

    hash[i+1] = hash[i];

    if(s == "!"){
      int l, r, k;
      cin >> l,r,k;

      l += 5;
      r += 5;

      (get<0>(hash[i+1]) += (mod1+k)%mod1 * (x[r] - x[l] + mod1) % mod1) %= mod1;
      (get<1>(hash[i+1]) += (mod2+k)%mod2 * (y[r] - y[l] + mod2) % mod2) %= mod2;
      (get<2>(hash[i+1]) += (mod3+k)%mod3 * (z[r] - z[l] + mod3) % mod3) %= mod3;

      if(memo.count(hash[i+1]) == 0) memo[ hash[i+1] ] = i+1;
    }else if(s == "?"){
      println(memo[hash[i+1]]);
    }else{
      abort();
    }
  }


  return 0;
}