結果

問題 No.2942 Sigma Music Game Level Problem
ユーザー 👑 binapbinap
提出日時 2024-10-18 22:02:53
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,446 ms / 6,000 ms
コード長 4,257 bytes
コンパイル時間 4,551 ms
コンパイル使用メモリ 277,368 KB
実行使用メモリ 44,260 KB
最終ジャッジ日時 2024-11-15 13:24:55
合計ジャッジ時間 21,347 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 AC 595 ms
23,416 KB
testcase_12 AC 1,298 ms
41,440 KB
testcase_13 AC 1,094 ms
40,604 KB
testcase_14 AC 611 ms
21,140 KB
testcase_15 AC 552 ms
17,648 KB
testcase_16 AC 968 ms
38,584 KB
testcase_17 AC 294 ms
14,428 KB
testcase_18 AC 783 ms
29,916 KB
testcase_19 AC 1,307 ms
44,260 KB
testcase_20 AC 464 ms
21,588 KB
testcase_21 AC 1,446 ms
41,176 KB
testcase_22 AC 1,435 ms
41,176 KB
testcase_23 AC 383 ms
17,948 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 2 ms
5,248 KB
testcase_26 AC 719 ms
38,860 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

// Coodinate Compression
// https://youtu.be/fR3W5IcBGLQ?t=8550
template<typename T=int>
struct CC {
  bool initialized;
  vector<T> xs;
  CC(): initialized(false) {}
  void add(T x) { xs.push_back(x);}
  void init() {
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(),xs.end()),xs.end());
    initialized = true;
  }
  int operator()(T x) {
    if (!initialized) init();
    return upper_bound(xs.begin(), xs.end(), x) - xs.begin() - 1;
  }
  T operator[](int i) {
    if (!initialized) init();
    return xs[i];
  }
  int size() {
    if (!initialized) init();
    return xs.size();
  }
};

using S = pair<long long, int>;
S op(S s1, S s2){
	return S{s1.first + s2.first, s1.second + s2.second};
}
S e(){
	return S{0LL, 0};
}


int main(){
	int n, q, l0;
	cin >> n >> q >> l0;
	vector<tuple<int, int, int>> Query;
	
	vector<int> a(n);
	cin >> a;
	
	CC<int> cc;
	rep(i, n) cc.add(a[i]);
	
	rep(i, q){
		int t;
		cin >> t;
		if(t == 1){
			int x;
			cin >> x;
			Query.emplace_back(1, x, 0);
			cc.add(x);
		}
		if(t == 2){
			int l, r;
			cin >> l >> r;
			Query.emplace_back(2, l, r + 1);
		}
		if(t == 3){
			int l;
			cin >> l;
			Query.emplace_back(3, l, 0);
		}
	}
	
	int m = cc.size();
	vector<int> xs = cc.xs;
	segtree<S, op, e> seg(m);
	
	
	auto add = [&](int x){
		auto idx = cc(x);
		auto [sum, cnt] = seg.get(idx);
		seg.set(idx, S{sum + x, cnt + 1});
	};
	
	vector<pair<int, long long>> ans;
	rep(i, n) add(a[i]);
	
	rep(i, q){
		auto [t, var1, var2] = Query[i];
		if(t == 1){
			auto idx = cc(var1);
			auto [sum, cnt] = seg.get(idx);
			seg.set(idx, S{sum + var1, cnt + 1});
		}
		if(t == 2){
			auto idx_l = lower_bound(xs.begin(), xs.end(), var1) - xs.begin();
			auto idx_r = lower_bound(xs.begin(), xs.end(), var2) - xs.begin();
			auto [sum, cnt] = seg.prod(idx_l, idx_r);
			ans.emplace_back(cnt, sum);
		}
	}
	if(ans.size()){
		for(auto [cnt, sum] : ans){
			cout << cnt << ' ' << sum << "\n";
		}
	}else{
		cout << "Not Found!\n";
	}
	
	return 0;
}
0