답안 #376838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376838 2021-03-12T05:12:50 Z b00n0rp 원숭이와 사과 나무 (IZhO12_apple) C++17
100 / 100
503 ms 237932 KB
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
// #define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
const int INF=1e9;

const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,c = 0,SZ = 1;

struct node{
    int l,r,lft,rgt,val,lazy;
    node(){
        lft = -1;
        rgt = -1;
    }
} seg[10000005];

void create_children(int ind){
    int l = seg[ind].l;
    int r = seg[ind].r;
    int m = (l+r)/2;
    seg[ind].lft = SZ++;
    seg[ind].rgt = SZ++;
    seg[seg[ind].lft].l = l;
    seg[seg[ind].lft].r = m;
    seg[seg[ind].rgt].l = m+1;
    seg[seg[ind].rgt].r = r;
}

void propagate(int ind){
    seg[ind].val = seg[ind].r-seg[ind].l+1;
    if(seg[ind].val > 1){
        if(seg[ind].lft == -1){
            create_children(ind);
        }
        seg[seg[ind].lft].lazy = 1;
        seg[seg[ind].rgt].lazy = 1;
    }
    seg[ind].lazy = 0;
}


void update(int ind,int l,int r){
    if(seg[ind].lazy) propagate(ind);
    if(seg[ind].l > r or seg[ind].r < l) return;
    if(seg[ind].l >= l and seg[ind].r <= r){
        seg[ind].lazy = 1;
        propagate(ind);
        return;
    }
    if(seg[ind].lft == -1) create_children(ind);
    update(seg[ind].lft,l,r);
    update(seg[ind].rgt,l,r);
    seg[ind].val = seg[seg[ind].lft].val+seg[seg[ind].rgt].val;
}
 
int query(int ind,int l,int r){
    if(seg[ind].lazy) propagate(ind);
    if(seg[ind].l > r or seg[ind].r < l) return 0;
    if(seg[ind].l >= l and seg[ind].r <= r){
        return seg[ind].val;
    }
    if(seg[ind].lft == -1) create_children(ind);
    return query(seg[ind].lft,l,r)+query(seg[ind].rgt,l,r);
}

void solvethetestcase(){
    seg[0].l = 1;
    seg[0].r = INF;

    cin >> n;
    REP(i,n){
        int t,x,y;
        cin >> t >> x >> y;
        x += c;
        y += c;
        if(t == 2){
            update(0,x,y);
        }
        else{
            c = query(0,x,y);
            cout << c << "\n";
        }
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 235216 KB Output is correct
2 Correct 122 ms 235116 KB Output is correct
3 Correct 124 ms 235116 KB Output is correct
4 Correct 152 ms 235244 KB Output is correct
5 Correct 151 ms 235244 KB Output is correct
6 Correct 138 ms 235244 KB Output is correct
7 Correct 141 ms 235244 KB Output is correct
8 Correct 246 ms 235372 KB Output is correct
9 Correct 391 ms 235756 KB Output is correct
10 Correct 398 ms 235692 KB Output is correct
11 Correct 410 ms 235628 KB Output is correct
12 Correct 407 ms 235628 KB Output is correct
13 Correct 364 ms 235756 KB Output is correct
14 Correct 368 ms 235856 KB Output is correct
15 Correct 486 ms 237932 KB Output is correct
16 Correct 503 ms 237880 KB Output is correct
17 Correct 383 ms 237804 KB Output is correct
18 Correct 361 ms 237804 KB Output is correct
19 Correct 498 ms 237880 KB Output is correct
20 Correct 490 ms 237836 KB Output is correct