답안 #338815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338815	2020-12-24T03:19:22 Z	talant117408	원숭이와 사과 나무 (IZhO12_apple)	C++17	0 / 100	45 ms	17784 KB

apple

/*
    Code written by Talant I.D.
*/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/rope>
//#include <ext/pb_ds/assoc_container.hpp>
 
//using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
 
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
  
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
  
inline bool isvowel(char ch){
    ch = tolower(ch);
    return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
  
inline bool isprime(int n){
    if(n < 2 || (n%2 == 0 && n != 2)) return false;
    for(int i = 3; i*i <= n; i++)
        if(n%i == 0) return false;
    return true;
}
 
class Union{
    private:
        vector <int> saizu, link;
    public:
        Union(int n){
            saizu.assign(n, 1); link.resize(n); 
            iota(all(link), 0);
        }
        int find(int n){
            if(link[n] == n) return n;
            return link[n] = find(link[n]);
        }
        int same(int a, int b){
            return find(a) == find(b);
        }
        void unite(int a, int b){
            if(same(a, b)) return;
             
            a = find(a); b = find(b);
            if(saizu[a] < saizu[b]) swap(a, b);
             
            saizu[a] += saizu[b];
            link[b] = a;
        }
        int getsize(int a){
            return saizu[find(a)];
        }
};
 
const int mod = 1e9+7;
 
ll mode(ll a){
    a %= mod;
    if(a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b){
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b){
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b){
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 1e6+7;
int tree[N*4], lz[N*4];

void push(int v, int l, int r){
    if(lz[v]){
        tree[v] = (r-l+1);
        if(l != r){
            lz[v<<1] = 1;
            lz[(v<<1)+1] = 1;
        }
        lz[v] = 0;
    }
}

void update(int v, int l, int r, int ql, int qr){
    push(v, l, r);
    if(l > qr || ql > r) return ;
    if(ql <= l && r <= qr){
        tree[v] = r-l+1;
        if(l != r){
            lz[v<<1] = 1;
            lz[(v<<1)+1] = 1;
        }
        return;
    }
    int mid = (l+r) >> 1;
    update(v<<1, l, mid, ql, qr);
    update((v<<1)+1, mid+1, r, ql, qr);
    tree[v] = tree[v<<1]+tree[(v<<1)+1];
}

int get(int v, int l, int r, int ql, int qr){
    push(v, l, r);
    if(l > qr || ql > r) return 0;
    if(ql <= l && r <= qr) return tree[v];
    int mid = (l+r) >> 1;
    return get(v<<1, l, mid, ql, qr)+get((v<<1)+1, mid+1, r, ql, qr);
}

int main(){
    do_not_disturb
    
    int q;
    int already = 0;
    cin >> q;
    while(q--){
        int type, l, r;
        cin >> type >> l >> r;
        if(type == 1){
            auto ans = get(1, 1, N, l+already, r+already);
            cout << ans << endl;
            already = ans;
        }
        else{
            update(1, 1, N, l+already, r+already);
        }
    }
    
    return 0;
}

Subtask #1

0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	19 ms	15340 KB	Output is correct
5	Correct	22 ms	17004 KB	Output is correct
6	Correct	21 ms	15468 KB	Output is correct
7	Correct	26 ms	16896 KB	Output is correct
8	Incorrect	45 ms	17784 KB	Output isn't correct
9	Halted	0 ms	0 KB	-