結果
| 問題 | No.3094 Stapler |
| ユーザー |
 hato336
|
| 提出日時 | 2025-04-06 18:18:53 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 204 ms / 2,000 ms |
| コード長 | 8,778 bytes |
| コンパイル時間 | 6,635 ms |
| コンパイル使用メモリ | 333,600 KB |
| 実行使用メモリ | 66,412 KB |
| 最終ジャッジ日時 | 2025-06-20 02:32:09 |
| 合計ジャッジ時間 | 17,069 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 72 |
ソースコード
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)
#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)
#define OVERLOAD_REP(_1, _2, _3, _4, name, ...) name
#define REP1(n) for(ll i=0;i<n;i++)
#define REP2(i, n) for (ll i=0;i<n;i++)
#define REP3(i, a, n) for (ll i=a;i<n;i++)
#define REP4(i, a, b, n) for(ll i=a;i<n;i+=b)
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)
#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name
#define RREP1(n) for(ll i=n-1;i>=0;i--)
#define RREP2(i, n) for(ll i=n-1;i>=0;i--)
#define RREP3(i, a, n) for(ll i=n-1;i>=a;i--)
#define RREP4(i, a, b, n) for(ll i=n-1;i>=a;i-=b)
#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)
#define foa(a,v) (auto& a : (v))
#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define len(n) (long long)(n).size()
#define pb push_back
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using vvs = vector<vs>;
using vvvs = vector<vvs>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vc = vector<char>;
using vvc = vector<vc>;
using vvvc = vector<vvc>;
using pll = pair<ll,ll>;
using vpll = vector<pll>;
template<class... T>
constexpr auto min(T... a){
return min(initializer_list<common_type_t<T...>>{a...});
}
template<class... T>
constexpr auto max(T... a){
return max(initializer_list<common_type_t<T...>>{a...});
}
template<class... T>
void input(T&... a){
(cin >> ... >> a);
}
ll POW(ll a,ll b){
ll ans = 1;
while (b){
if (b & 1){
ans *= a;
}
a *= a;
b /= 2;
}
return ans;
}
ll MODPOW(ll a,ll b,ll c){
ll ans = 1;
while (b){
if (b & 1){
ans *= a;
ans %= c;
}
a *= a;
a %= c;
b /= 2;
}
return ans;
}
#define OVERLOAD_POW(_1, _2, _3, name, ...) name
#define pow(...) OVERLOAD_POW(__VA_ARGS__, MODPOW, POW)(__VA_ARGS__)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)
#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}
#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}
#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}
#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}
#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}
#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}
#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}
#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}
#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}
#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}
#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}
#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}
#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}
#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}
#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}
#define PLL(name) pll name;cin>>name.first>>name.second;
#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}
void print(){cout << "\n";}
template<class T, class... Ts>
void print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\n';}
void print(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}
void print(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}
void print(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}
void print(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}
void print(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}
void print(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}
void print(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}
void print(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}
void print(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}
void print(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}
void print(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}
void print(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}}
void print(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}}
void print(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}}
void print(pll x){cout << x.first << x.second << '\n';}
void print(vpll x){rep(i,len(x)){cout << x[i].first << x[i].second << '\n';}}
/*
struct LazySegmentTree {
int n;
vector<int> zero_count, lazy, size;
LazySegmentTree(int _n) {
n = 1;
while (n < _n) n <<= 1;
zero_count.assign(2 * n, 1);
lazy.assign(2 * n, 0);
size.assign(2 * n, 1);
// 各ノードのサイズを設定
for (int i = n - 1; i > 0; --i) {
size[i] = size[i << 1] + size[i << 1 | 1];
}
}
void push(int k, int l, int r) {
if (lazy[k] != 0 && r - l > 1) {
apply(k << 1, lazy[k]);
apply(k << 1 | 1, lazy[k]);
}
lazy[k] = 0;
}
void apply(int k, int val) {
lazy[k] += val;
if (lazy[k] == 0) {
// 値が0の場合、zero_countはそのノードのサイズ
zero_count[k] = size[k];
} else {
// 加算後に0じゃなくなる場合は0カウントなし
zero_count[k] = 0;
}
}
void update(int a, int b, int x, int k = 1, int l = 0, int r = -1) {
if (r == -1) r = n;
if (r <= a || b <= l) return;
if (a <= l && r <= b) {
apply(k, x);
return;
}
push(k, l, r);
int m = (l + r) / 2;
update(a, b, x, k << 1, l, m);
update(a, b, x, k << 1 | 1, m, r);
zero_count[k] = zero_count[k << 1] + zero_count[k << 1 | 1];
}
int query(int a, int b, int k = 1, int l = 0, int r = -1) {
if (r == -1) r = n;
if (r <= a || b <= l) return 0;
if (a <= l && r <= b) return zero_count[k];
push(k, l, r);
int m = (l + r) / 2;
return query(a, b, k << 1, l, m) + query(a, b, k << 1 | 1, m, r);
}
};
*/
pll op(pll x,pll y){
if(x.first < y.first){
return x;
}
else if(x.first > y.first){
return y;
}
return {x.first,x.second + y.second};
}
pll mapping(ll x,pll y){
return {y.first + x,y.second};
}
ll composition(ll x,ll y){
return x + y;
}
pll e(){
return {0,0};
}
ll id(){
return 0;
}
int main(){
LL(n,q);
vpll v(n,{0,1});
lazy_segtree<pll,op,e,ll,mapping,composition,id> st(v);
vvll query;
rep(i,q){
LL(t);
if(t == 1){
LL(l,r);
l--;
r--;
st.apply(l+1,r+1,1);
query.push_back({l,r});
}
if(t == 2){
LL(idx);
idx--;
ll l = query[idx][0];
ll r = query[idx][1];
st.apply(l+1,r+1,-1);
query.push_back({-1,-1});
}
if(t == 3){
print(st.prod(0,n).second);
query.push_back({-1,-1});
}
}
}