結果
問題 | No.3094 Stapler |
ユーザー |
👑 |
提出日時 | 2025-04-06 16:47:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 351 ms / 2,000 ms |
コード長 | 3,101 bytes |
コンパイル時間 | 3,581 ms |
コンパイル使用メモリ | 262,260 KB |
実行使用メモリ | 31,584 KB |
最終ジャッジ日時 | 2025-06-20 02:31:36 |
合計ジャッジ時間 | 16,428 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 72 |
コンパイルメッセージ
main.cpp: In function ‘S op(S, S)’: main.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type] 32 | } | ^
ソースコード
#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 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);} const int INF = 1001001001; using S = pair<int, int>; S op(S a, S b){ if(a.first < b.first) return a; if(a.first > b.first) return b; if(a.first == b.first) return S{a.first, a.second + b.second}; } S e(){ return S{INF, 0}; } using F = int; S mapping(F f, S x){ return S{x.first + f, x.second}; } F composition(F f, F g){ return f + g; } F id(){ return 0; } int main(){ int n; cin >> n; int q; cin >> q; atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(n); rep(i, n){ seg.set(i, S{0, 1}); } vector<tuple<int, int, int>> Query; rep(_, q){ int t; cin >> t; if(t == 1){ int l, r; cin >> l >> r; l--; r--; seg.apply(l, r, +1); Query.emplace_back(1, l, r); } if(t == 2){ int i; cin >> i; i--; auto [dummy, l, r] = Query[i]; seg.apply(l, r, -1); Query.emplace_back(2, i, 0); } if(t == 3){ auto x = seg.all_prod(); cout << x.second << "\n"; Query.emplace_back(3, 0, 0); } } return 0; }