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

提出ソース

結果

問題	No.469 区間加算と一致検索の問題
ユーザー	shimomire
提出日時	2016-12-19 01:33:49
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	232 ms / 5,000 ms
コード長	6,516 bytes
コンパイル時間	1,311 ms
コンパイル使用メモリ	138,360 KB
実行使用メモリ	14,584 KB
最終ジャッジ日時	2024-12-21 16:43:44
合計ジャッジ時間	7,926 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,248 KB
testcase_03	AC	7 ms 5,248 KB
testcase_04	AC	9 ms 5,248 KB
testcase_05	AC	9 ms 5,248 KB
testcase_06	AC	11 ms 5,248 KB
testcase_07	AC	13 ms 5,248 KB
testcase_08	AC	12 ms 5,248 KB
testcase_09	AC	6 ms 5,248 KB
testcase_10	AC	9 ms 5,248 KB
testcase_11	AC	4 ms 5,248 KB
testcase_12	AC	13 ms 5,248 KB
testcase_13	AC	8 ms 5,248 KB
testcase_14	AC	3 ms 5,248 KB
testcase_15	AC	4 ms 5,248 KB
testcase_16	AC	12 ms 5,248 KB
testcase_17	AC	11 ms 5,248 KB
testcase_18	AC	11 ms 5,248 KB
testcase_19	AC	3 ms 5,248 KB
testcase_20	AC	13 ms 5,248 KB
testcase_21	AC	4 ms 5,248 KB
testcase_22	AC	2 ms 5,248 KB
testcase_23	AC	91 ms 8,832 KB
testcase_24	AC	89 ms 8,832 KB
testcase_25	AC	91 ms 8,704 KB
testcase_26	AC	92 ms 8,832 KB
testcase_27	AC	89 ms 8,832 KB
testcase_28	AC	89 ms 8,704 KB
testcase_29	AC	93 ms 8,704 KB
testcase_30	AC	87 ms 8,704 KB
testcase_31	AC	89 ms 8,832 KB
testcase_32	AC	92 ms 8,832 KB
testcase_33	AC	232 ms 14,456 KB
testcase_34	AC	224 ms 14,584 KB
testcase_35	AC	226 ms 14,584 KB
testcase_36	AC	227 ms 14,572 KB
testcase_37	AC	228 ms 14,584 KB
testcase_38	AC	223 ms 11,192 KB
testcase_39	AC	211 ms 11,252 KB
testcase_40	AC	216 ms 11,232 KB
testcase_41	AC	214 ms 11,260 KB
testcase_42	AC	211 ms 11,256 KB
testcase_43	AC	206 ms 11,256 KB
testcase_44	AC	213 ms 11,128 KB
testcase_45	AC	213 ms 11,128 KB
testcase_46	AC	212 ms 11,256 KB
testcase_47	AC	210 ms 11,256 KB
testcase_48	AC	2 ms 5,248 KB
testcase_49	AC	2 ms 5,248 KB
testcase_50	AC	222 ms 11,252 KB
testcase_51	AC	215 ms 11,132 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug==
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<60;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-12;};
template<> inline long double EPS<long double>(){return 1e-12;};

// min{2^r | n < 2^r}
template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}


template<class Cost> struct Edge{
    int to;Cost cost;
    Edge(int to,Cost cost):to(to),cost(cost){};
    bool operator<(Edge r) const{ return cost<r.cost;}
    bool operator>(Edge r) const{ return cost>r.cost;}
};
template<class Cost> ostream& operator << (ostream& os, const Edge<Cost>& e){ return os<<"(->"<<e.to <<","<<e.cost<<")";}
template<class Cost> using Graph = vector<vector<Edge<Cost>>>;


struct mint{
    ll x, mod;
    mint(ll x,ll mod=1e9+7):x((x%mod+mod)%mod),mod(mod){}
    mint():mint(0){}
    mint operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
    mint operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
    mint operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
    mint operator+(const mint& a)const{ return mint(*this) += a;}
    mint operator-(const mint& a)const{ return mint(*this) -= a;}
    mint operator*(const mint& a)const{ return mint(*this) *= a;}
    bool operator==(const mint& a)const{ return x == a.x;}

    // O(logN)
    mint pow(ll N){
        mint r(1),x = *this;
        while(N){
            if(N&1) r *= x;
            N /= 2;
            x *= x;
        }
        return r;
    }
    mint minv(){return pow(mod-2);}
};
istream& operator >> (istream& is,mint& p){return is>>p.x;}
ostream& operator << (ostream& os,mint m){os << m.x;return os;}

class VH{
public:
	ll operator()(const vector<mint>& x) const{
		return x[0].x*1000000007LL + x[1].x;
	}
};

class Main{
	public:

	void run(){
		int N,Q;cin >> N >> Q;
		vector<ll> mods = {999999937LL, 1000000007LL};ll  base = 1e7+1;

		unordered_map<vector<mint>,int,VH> vmap;

		vector<mint> mv(2);
		for(int i:range(2))mv[i] =mint(0,mods[i]);

		vmap[mv] = 0;
		for(int q:range(Q)){
			char c;cin >> c;
			if(c=='!'){
				int l,r,v;cin >> l >> r >> v;
				for(int i:range(2)){
					mv[i] += mint(v,mods[i]) * (mint(base,mods[i]).pow(r) - mint(base,mods[i]).pow(l)) * mint(base-1).pow(mods[i]-1);
				}
				if(!vmap.count(mv)){
					vmap[mv] = q+1;
				}
			}else{
				cout << vmap[mv] << endl;
			}
		}
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}

yukicoder

結果

テストケース

ソースコード