oj.uz

답안 #940131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940131 2024-03-07T05:51:24 Z Baizho 원숭이와 사과 나무 (IZhO12_apple) C++14
100 / 100
 326 ms 208988 KB 
#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;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,avx2")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e6)+100;
const int M = ll(2e5) + 100;
const long long inf = 2e18;
//const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

#define int ll
int m;
int t[N * 80], lv[N * 80], rv[N * 80], ver = 1;
bool u[N * 80];

void push(int v, int tl, int tr) {
	if(u[v]) {
		t[v] = tr - tl + 1;
		if(tl != tr) {
			if(!lv[v]) lv[v] = ++ ver;
			if(!rv[v]) rv[v] = ++ ver;
			u[lv[v]] |= u[v];
			u[rv[v]] |= u[v];
		}
		u[v] = 0;
	}
}

void update(int v, int tl, int tr, int l, int r) {
	push(v, tl, tr);
	if(l > tr || tl > r) return;
	if(l <= tl && tr <= r) {
		u[v] = 1;
		push(v, tl, tr);
		return;
	}
	int tm = (tl + tr) / 2;
	if(!lv[v]) {
		lv[v] = ++ver;
	}
	update(lv[v], tl, tm, l, r);
	if(!rv[v]) {
		rv[v] = ++ver;
	}
	update(rv[v], tm + 1, tr, l, r);
	t[v] = t[lv[v]] + t[rv[v]];
}

int get(int v, int tl, int tr, int l, int r) {
	push(v, tl, tr);
	if(tl > r || l > tr) return 0;
	if(l <= tl && tr <= r) return t[v];
	int tm = (tl + tr) / 2;
	int res = 0;
	if(lv[v]) res += get(lv[v], tl, tm, l, r);
	if(rv[v]) res += get(rv[v], tm + 1, tr, l, r);
	return res;
}

void Baizho() {
	cin>>m;
	int c = 0;
	while(m --) {
		int d, x, y; cin>>d>>x>>y;
		x += c, y += c;
		if(d == 1) {
			c = get(1, 1, 1e9, x, y);
			cout<<c<<"\n";
		} else {
			update(1, 1, 1e9, x, y);
		}
	}
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

apple.cpp: In function 'void Freopen(std::string)':
apple.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
apple.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 9 ms 7516 KB Output is correct
5 Correct 15 ms 10076 KB Output is correct
6 Correct 11 ms 9820 KB Output is correct
7 Correct 11 ms 9948 KB Output is correct
8 Correct 93 ms 42836 KB Output is correct
9 Correct 189 ms 74836 KB Output is correct
10 Correct 186 ms 82260 KB Output is correct
11 Correct 209 ms 88752 KB Output is correct
12 Correct 218 ms 90292 KB Output is correct
13 Correct 179 ms 112212 KB Output is correct
14 Correct 205 ms 115004 KB Output is correct
15 Correct 326 ms 202852 KB Output is correct
16 Correct 309 ms 203944 KB Output is correct
17 Correct 263 ms 117332 KB Output is correct
18 Correct 183 ms 117432 KB Output is correct
19 Correct 322 ms 208988 KB Output is correct
20 Correct 322 ms 208796 KB Output is correct