oj.uz

Submission #890343

# Submission time Handle Problem Language Result Execution time Memory
890343 2023-12-21T04:01:20 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 1634 ms 245096 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<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")


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(2e6)+10;
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); }


int n, m, a[N], u[N], sta[24][N], LOG[N], ans[N];
int ql[N], qr[N], qk[N];
vector<int> q[N];

int getmx (int l, int r) {
	if(l > r) return 0;
	int j = LOG[r - l + 1];
	return max(sta[j][l], sta[j][r-(1<<j)+1]);
}

struct tre {
	int mx, ans;
} t[N * 4];

tre combine(tre a, tre b) {
	tre c; 
	c.mx = max(a.mx, b.mx);
	c.ans = max(a.ans, b.ans);
	return c;
}

void build(int v, int tl, int tr) {
	u[v] = -1;
	if(tl == tr) {
		t[v] = {a[tl], 0};
		return;
	}
	int tm = (tl + tr) / 2;
	build(v + v, tl, tm);
	build(v + v + 1, tm + 1, tr);
	t[v] = combine(t[v + v], t[v + v + 1]);
}

void push(int v, int tl, int tr){
	if(u[v] != -1) {
		t[v].ans = t[v].mx + u[v];
		if(tl != tr) {
			u[v + v] = u[v];
			u[v + v + 1] = u[v];
		}
		u[v] = -1;
	}
} 

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

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

void Baizho() {	
	for(int i = 2; i < N; i ++) LOG[i] = LOG[i / 2] + 1;
	cin>>n>>m;
	for(int i = 1; i <= n; i ++) {
		cin>>a[i];
		sta[0][i] = a[i];
	}
	build(1, 1, n);
	for(int j = 1; j <= 21; j ++) {
		for(int i = 1; i+(1<<j)-1 <= n; i ++) {
			sta[j][i] = max(sta[j-1][i], sta[j-1][i+(1<<j-1)]);
		}
	}
	for(int i = 1; i <= m; i ++) {
		cin>>ql[i]>>qr[i]>>qk[i];
		q[ql[i]].pb(i);
	}
	for(int i = n; i >= 1; i --) {
		int l = i + 1, r = i;
		int bl = i + 1, br = n;
		while(bl <= br) {
			int mid = (bl + br) / 2;
			if(getmx(i + 1, mid) < a[i]) bl = mid + 1, r = mid;
			else br = mid - 1;
		}
		if(l <= r) {
			update(1, 1, n, l, r, a[i]);
//			cout<<i<<" "<<l<<" "<<r<<"\n";
		}
		for(auto j : q[i]) {
			ans[j] = (get(1, 1, n, ql[j], qr[j]).ans <= qk[j]);
		}
	}
	for(int i = 1; i <= m; i ++) cout<<ans[i]<<"\n";
	
}
 
signed main() {		
 
    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

sortbooks.cpp: In function 'void Baizho()':
sortbooks.cpp:114:49: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  114 |    sta[j][i] = max(sta[j-1][i], sta[j-1][i+(1<<j-1)]);
      |                                                ~^~
sortbooks.cpp: In function 'void Freopen(std::string)':
sortbooks.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); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73048 KB Output is correct
2 Correct 15 ms 69024 KB Output is correct
3 Correct 18 ms 83292 KB Output is correct
4 Correct 16 ms 79196 KB Output is correct
5 Correct 17 ms 83292 KB Output is correct
6 Correct 17 ms 85340 KB Output is correct
7 Correct 17 ms 85340 KB Output is correct
8 Correct 16 ms 85472 KB Output is correct
9 Correct 16 ms 85336 KB Output is correct
10 Correct 16 ms 85340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73048 KB Output is correct
2 Correct 15 ms 69024 KB Output is correct
3 Correct 18 ms 83292 KB Output is correct
4 Correct 16 ms 79196 KB Output is correct
5 Correct 17 ms 83292 KB Output is correct
6 Correct 17 ms 85340 KB Output is correct
7 Correct 17 ms 85340 KB Output is correct
8 Correct 16 ms 85472 KB Output is correct
9 Correct 16 ms 85336 KB Output is correct
10 Correct 16 ms 85340 KB Output is correct
11 Correct 21 ms 89436 KB Output is correct
12 Correct 19 ms 93788 KB Output is correct
13 Correct 20 ms 93828 KB Output is correct
14 Correct 23 ms 93788 KB Output is correct
15 Correct 22 ms 93788 KB Output is correct
16 Correct 20 ms 93880 KB Output is correct
17 Correct 20 ms 94300 KB Output is correct
18 Correct 20 ms 93788 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1634 ms 245096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 116304 KB Output is correct
2 Correct 102 ms 115340 KB Output is correct
3 Correct 101 ms 116024 KB Output is correct
4 Correct 108 ms 116308 KB Output is correct
5 Correct 102 ms 116312 KB Output is correct
6 Correct 78 ms 115024 KB Output is correct
7 Correct 79 ms 114924 KB Output is correct
8 Correct 87 ms 115660 KB Output is correct
9 Correct 50 ms 90320 KB Output is correct
10 Correct 87 ms 115664 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73048 KB Output is correct
2 Correct 15 ms 69024 KB Output is correct
3 Correct 18 ms 83292 KB Output is correct
4 Correct 16 ms 79196 KB Output is correct
5 Correct 17 ms 83292 KB Output is correct
6 Correct 17 ms 85340 KB Output is correct
7 Correct 17 ms 85340 KB Output is correct
8 Correct 16 ms 85472 KB Output is correct
9 Correct 16 ms 85336 KB Output is correct
10 Correct 16 ms 85340 KB Output is correct
11 Correct 21 ms 89436 KB Output is correct
12 Correct 19 ms 93788 KB Output is correct
13 Correct 20 ms 93828 KB Output is correct
14 Correct 23 ms 93788 KB Output is correct
15 Correct 22 ms 93788 KB Output is correct
16 Correct 20 ms 93880 KB Output is correct
17 Correct 20 ms 94300 KB Output is correct
18 Correct 20 ms 93788 KB Output is correct
19 Correct 243 ms 132928 KB Output is correct
20 Correct 252 ms 132940 KB Output is correct
21 Correct 204 ms 130640 KB Output is correct
22 Correct 204 ms 130640 KB Output is correct
23 Correct 212 ms 130580 KB Output is correct
24 Correct 175 ms 130388 KB Output is correct
25 Correct 168 ms 130644 KB Output is correct
26 Correct 193 ms 131612 KB Output is correct
27 Correct 187 ms 131408 KB Output is correct
28 Correct 204 ms 131664 KB Output is correct
29 Correct 237 ms 133044 KB Output is correct
30 Correct 248 ms 132952 KB Output is correct
31 Correct 215 ms 132936 KB Output is correct
32 Correct 217 ms 132944 KB Output is correct
33 Correct 238 ms 132844 KB Output is correct
34 Correct 169 ms 130132 KB Output is correct
35 Correct 160 ms 130200 KB Output is correct
36 Correct 158 ms 130132 KB Output is correct
37 Correct 156 ms 130080 KB Output is correct
38 Correct 159 ms 130064 KB Output is correct
39 Correct 194 ms 131512 KB Output is correct
40 Correct 139 ms 125152 KB Output is correct
41 Correct 192 ms 131532 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 73048 KB Output is correct
2 Correct 15 ms 69024 KB Output is correct
3 Correct 18 ms 83292 KB Output is correct
4 Correct 16 ms 79196 KB Output is correct
5 Correct 17 ms 83292 KB Output is correct
6 Correct 17 ms 85340 KB Output is correct
7 Correct 17 ms 85340 KB Output is correct
8 Correct 16 ms 85472 KB Output is correct
9 Correct 16 ms 85336 KB Output is correct
10 Correct 16 ms 85340 KB Output is correct
11 Correct 21 ms 89436 KB Output is correct
12 Correct 19 ms 93788 KB Output is correct
13 Correct 20 ms 93828 KB Output is correct
14 Correct 23 ms 93788 KB Output is correct
15 Correct 22 ms 93788 KB Output is correct
16 Correct 20 ms 93880 KB Output is correct
17 Correct 20 ms 94300 KB Output is correct
18 Correct 20 ms 93788 KB Output is correct
19 Incorrect 1634 ms 245096 KB Output isn't correct
20 Halted 0 ms 0 KB -