#228627 (C++14) No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ

提出ソース

結果

問題	No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
ユーザー	しらっ亭
提出日時	2018-01-09 01:17:35
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	169 ms / 5,000 ms
コード長	6,795 bytes
コンパイル時間	1,333 ms
コンパイル使用メモリ	121,496 KB
実行使用メモリ	9,368 KB
最終ジャッジ日時	2024-06-06 02:26:23
合計ジャッジ時間	3,311 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	9 ms 6,940 KB
testcase_07	AC	3 ms 6,944 KB
testcase_08	AC	3 ms 6,944 KB
testcase_09	AC	76 ms 6,940 KB
testcase_10	AC	59 ms 6,940 KB
testcase_11	AC	42 ms 6,944 KB
testcase_12	AC	75 ms 6,940 KB
testcase_13	AC	12 ms 6,940 KB
testcase_14	AC	43 ms 9,368 KB
testcase_15	AC	99 ms 9,200 KB
testcase_16	AC	124 ms 9,364 KB
testcase_17	AC	169 ms 9,272 KB
testcase_18	AC	79 ms 9,268 KB
testcase_19	AC	102 ms 9,348 KB

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

ソースコード

raw source code

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <tuple>
#include <cstring>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

template <class V> struct SegTreeLazy {
	static const V zero = 0;
	static const V def = 0;
	struct Node {
		V dat;
		V lazy;
		bool flag;
		Node() : dat(def), lazy(zero), flag(false) {}
	};

	static V merge(const V &l, const V &r) {
		return l + r;
	}

	const int N;
	vector<Node> seg;

	SegTreeLazy(int size) : N(p2(size)), seg(N * 2) {};

	void set(int i, const V &v) { seg[i + N - 1].dat = v; }

	void build() { for (int i = N - 2; i >= 0; i--) seg[i].dat = merge(seg[i * 2 + 1].dat, seg[i * 2 + 2].dat); }

	void update(int a, int b, V v) {
		update(a, b, v, 0, 0, N);
	}

	V query(int a, int b) {
		return query(a, b, 0, 0, N);
	}

	private:
	void push(int k, int l, int r) {
		if (seg[k].flag) {
			seg[k].dat = seg[k].lazy * (r - l);
			if (r - l > 1) {
				seg[k * 2 + 1].lazy = seg[k].lazy;
				seg[k * 2 + 2].lazy = seg[k].lazy;
				seg[k * 2 + 1].flag = true;
				seg[k * 2 + 2].flag = true;
			}
			seg[k].lazy = zero;
			seg[k].flag = false;
		}
	}

	void update(int a, int b, V v, int k, int l, int r) {
		push(k, l, r);
		if (r <= a || b <= l) return;
		if (a <= l && r <= b) {
			seg[k].lazy = v;
			seg[k].flag = true;
			push(k, l, r);
		}
		else {
			update(a, b, v, k * 2 + 1, l, (l + r) / 2);
			update(a, b, v, k * 2 + 2, (l + r) / 2, r);
			seg[k].dat = merge(seg[k * 2 + 1].dat, seg[k * 2 + 2].dat);
		}
	}

	V query(int a, int b, int k, int l, int r) {
		push(k, l, r);
		if (r <= a || b <= l) return zero;
		if (a <= l && r <= b) return seg[k].dat;
		V x = query(a, b, k * 2 + 1, l, (l + r) / 2);
		V y = query(a, b, k * 2 + 2, (l + r) / 2, r);
		return merge(x, y);
	}

	static int p2(int n, int m=1) { return m >= n ? m : p2(n, m * 2); }
};
template<class Val> ostream& operator<<(ostream& os, const SegTreeLazy<Val>& seg) {
	SegTreeLazy<Val> &seg2 = const_cast<SegTreeLazy<Val>&>(seg);
	vector<Val> vec;
	for (int i = 0; i < seg2.N; i++) {
		vec.emplace_back(seg2.query(i, i+1));
	}
	os << vec;
	return os;
}


void Main() {
	int n = ri(), q = ri();

	SegTreeLazy<int> a(n), b(n);

	ll ba = 0, bb = 0;

	rep(_, q) {
		int type = ri();
		int l = ri(), r = ri()+1;

		if (type == 0) {
			int sa = a.query(l, r);
			int sb = b.query(l, r);
			if (sa > sb) ba += sa;
			if (sb > sa) bb += sb;
		}
		else if (type == 1) {
			a.update(l, r, 1);
			b.update(l, r, 0);
		}
		else if (type == 2) {
			a.update(l, r, 0);
			b.update(l, r, 1);
		}
	}
	int sa = a.query(0, n);
	int sb = b.query(0, n);

	cout << (sa + ba) << ' ' << (sb + bb) << '\n';
}

signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();
	return 0;
}

yukicoder

結果

テストケース

ソースコード