Submission #344265

#	Time	Username	Problem	Language	Result	Execution time	Memory
344265		IZhO_2021_I_want_Silver	Monkey and Apple-trees (IZhO12_apple)	C++14	0 / 100	4 ms	492 KiB

apple

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define int ll

const int N = 2e5 + 5;
const int oo = 1e9 + 5;

int m;
set <pll> st2;

void solve() {
    cin >> m;
    int c = 0;
    for (int i = 1; i <= m; ++i) {
        int d, l, r;
        cin >> d >> l >> r;
        l += c, r += c;
        //vec.pb(l); vec.pb(r);
        if (d == 1) { // (l-7, r-11) { (l2-1, r2-7); (l2-10, r2-12); }
            int res = 0;
            for (auto j = /*st2.begin()*/st2.lower_bound({l, -oo}); j != st2.end(); ++j) {
                int r2 = j -> F, l2 = j -> S;
                if (r2 < l) { continue; }
                if (r < l2) { break; }
                l2 = max(l, l2);
                r2 = min(r, r2);
                res += (r2 - l2 + 1);
            }
            cout << res <<"\n";
            c = res;
        }
        if (d == 2) {
            if (sz(st2)) {
                auto it2 = st2.lower_bound({l, -oo});
                if (it2 != st2.end()) {
                    int r2 = it2 -> F, l2 = it2 -> S;
                    if (l2 <= r) {
                        st2.erase({r2, l2});
                        st2.insert({max(r2, r), min(l2, l)});
                        //vec.pb(min(l2, l)); vec.pb(max(r2, r));
                    }
                    else { st2.insert({r, l}); }
                }
                else { st2.insert({r, l}); }
            }
            else { st2.insert({r, l}); }
        }
    }
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message (stderr)

apple.cpp:87:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   87 |  main () {
      |        ^

• Subtask 1: 0 / 100