#include <iostream> //cin, cout
/*
#include <fstream>
std::ifstream cin ("ex.in");
std::ofstream cout ("ex.out");
*/
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
//usings
using namespace std;
using namespace __gnu_pbds;
// misc
#define ll long long
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template<typename T, typename U> bool emin(T &a, const U &b){ return b < a ? a = b, true : false; }
template<typename T, typename U> bool emax(T &a, const U &b){ return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz(x,y) x.resize(y)
#define all(x) x.begin(), x.end()
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T> using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// maps
#define mii map<int, int>
#define mll map<ll, ll>
// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRe(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define Fe(x, y) F(x, y + 1)
#define A(x, y) for(auto &x : y)
struct Node {
int l, r, v = 0;
Node *lc = nullptr, *rc = nullptr;
int lazy = 0;
Node(int tl, int tr){l = tl; r = tr;}
void extend(){
if(!lc && l < r){
int m = (l + r) / 2;
lc = new Node(l, m);
rc = new Node(m + 1, r);
}
}
void put(int x, int y){
extend();
if(lazy == 1){
v = r - l + 1;
if(lc){
emax(lc->lazy, 1);
emax(rc->lazy, 1);
}
lazy = 2;
}
if(r < x || l > y) return;
if(x <= l && r <= y) {
v = r - l + 1;
if(lc){
emax(lc->lazy, 1);
emax(rc->lazy, 1);
}
lazy = 2;
}
if(lc){
lc->put(x, y);
rc->put(x, y);
v = max(v, lc->v + rc->v);
}
}
int get(int x, int y){
if(lazy == 1){
v = r - l + 1;
if(lc){
emax(lc->lazy, 1);
emax(rc->lazy, 1);
}
lazy = 2;
}
if(x <= l && r <= y) return v;
if(r < x || l > y) return 0;
extend();
return lc->get(x, y) + rc->get(x, y);
}
};
int main(){
Node node(0, 10);
int an = 0;
int m; cin >> m;
while(m--){
int w, x, y; cin >> w >> x >> y;
x--; y--;
x += an; y += an;
if(w == 1){
int pan = node.get(x, y);
cout << pan << endl;
an += pan;
} else {
node.put(x, y);
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
