oj.uz

Submission #889976

# Submission time Handle Problem Language Result Execution time Memory
889976 2023-12-20T10:29:39 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 1717 ms 18704 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(2e5)+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); }

const int B = 900;

int n, m, w[N], sta[20][N], LOG[N], mxsuf[N];
//int ql[N], qr[N], qk[N]
int get(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]);
}

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>>w[i];
		sta[0][i] = w[i];
	}
	for(int j = 1; j <= 19; 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 <= n; i ++) {
		if(i % B == 1) {
			int r = min(n, i + B - 1), mx = 0, ans = 0;
			for(int j = i; j <= r; j ++) {
				if(mx > w[j]) mxsuf[j] = mx + w[j];
				mx = max(mx, w[j]);
			}
			for(int j = r - 1; j >= i; j --) mxsuf[j] = max(mxsuf[j], mxsuf[j + 1]);
		}
	}
//	for(int i = 1; i <= n; i ++) cout<<mxsuf[i]<<" ";
//	cout<<"\n";
	while(m --) {
		int l, r, k; cin>>l>>r>>k;
		int bl = (l - 1) / B, br = (r - 1) / B;
		if(bl == br) {
			int mx = 0, ans = 0;
			for(int i = l; i <= r; i ++) {
				if(mx > w[i]) ans = max(ans, w[i] + mx);
				mx = max(mx, w[i]);
			}
			cout<<(ans <= k)<<"\n";
			continue;
		}
		int ans = 0, mx = 0;
		for(int i = l; i <= bl * B + B; i ++) {
			if(mx > w[i]) ans = max(ans, w[i] + mx);
			mx = max(mx, w[i]);
		}
		for(int b = bl + 1; b < br; b ++) {
			int pos = b * B;
			for(int binl = b * B + 1, binr = b * B + B; binl <= binr; ) {
				int mid = (binl + binr) / 2;
				if(get(b * B + 1, mid) < mx) binl = mid + 1, pos = mid;
				else binr = mid - 1;
			}
			if(pos >= b * B + 1) ans = max(ans, get(b * B + 1, pos) + mx);
			if(pos < b * B + B) ans = max(ans, mxsuf[pos + 1]);
			mx = max(mx, get(b * B + 1, b * B + B));
		}
		for(int i = br * B + 1; i <= r; i ++) {
			if(mx > w[i]) ans = max(ans, w[i] + mx);
			mx = max(mx, w[i]);
		}
		cout<<(ans <= k)<<"\n";
	}
	
}
  
signed main() {		
 
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
   	
    int ttt = 1;
//    cin>>ttt;

    for(int i=1; i<=ttt; i++) { Baizho(); }
}

Compilation message

sortbooks.cpp: In function 'void Baizho()':
sortbooks.cpp:55:49: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   55 |    sta[j][i] = max(sta[j-1][i], sta[j-1][i+(1<<j-1)]);
      |                                                ~^~
sortbooks.cpp:60:39: warning: unused variable 'ans' [-Wunused-variable]
   60 |    int r = min(n, i + B - 1), mx = 0, ans = 0;
      |                                       ^~~
sortbooks.cpp: In function 'void Freopen(std::string)':
sortbooks.cpp:34:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:34:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 | 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 1 ms 3160 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 7260 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 1 ms 7260 KB Output is correct
9 Correct 1 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 7260 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 1 ms 7260 KB Output is correct
9 Correct 1 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 4 ms 9308 KB Output is correct
12 Correct 5 ms 11356 KB Output is correct
13 Correct 7 ms 11356 KB Output is correct
14 Correct 9 ms 11356 KB Output is correct
15 Correct 7 ms 11356 KB Output is correct
16 Correct 10 ms 11356 KB Output is correct
17 Correct 9 ms 11352 KB Output is correct
18 Correct 8 ms 11356 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 9052 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 14924 KB Output is correct
2 Correct 461 ms 14728 KB Output is correct
3 Correct 297 ms 15288 KB Output is correct
4 Correct 237 ms 14684 KB Output is correct
5 Correct 202 ms 14744 KB Output is correct
6 Correct 458 ms 14788 KB Output is correct
7 Correct 462 ms 14680 KB Output is correct
8 Correct 361 ms 14680 KB Output is correct
9 Correct 37 ms 9564 KB Output is correct
10 Correct 357 ms 15008 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 7260 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 1 ms 7260 KB Output is correct
9 Correct 1 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 4 ms 9308 KB Output is correct
12 Correct 5 ms 11356 KB Output is correct
13 Correct 7 ms 11356 KB Output is correct
14 Correct 9 ms 11356 KB Output is correct
15 Correct 7 ms 11356 KB Output is correct
16 Correct 10 ms 11356 KB Output is correct
17 Correct 9 ms 11352 KB Output is correct
18 Correct 8 ms 11356 KB Output is correct
19 Correct 659 ms 18300 KB Output is correct
20 Correct 681 ms 18160 KB Output is correct
21 Correct 1700 ms 18276 KB Output is correct
22 Correct 1717 ms 18036 KB Output is correct
23 Correct 1699 ms 18220 KB Output is correct
24 Correct 1652 ms 18100 KB Output is correct
25 Correct 1654 ms 18244 KB Output is correct
26 Correct 1338 ms 18260 KB Output is correct
27 Correct 1303 ms 18068 KB Output is correct
28 Correct 1179 ms 18212 KB Output is correct
29 Correct 617 ms 18184 KB Output is correct
30 Correct 607 ms 18000 KB Output is correct
31 Correct 655 ms 18180 KB Output is correct
32 Correct 663 ms 18004 KB Output is correct
33 Correct 667 ms 18196 KB Output is correct
34 Correct 1640 ms 18232 KB Output is correct
35 Correct 1642 ms 18704 KB Output is correct
36 Correct 1624 ms 18420 KB Output is correct
37 Correct 1654 ms 18008 KB Output is correct
38 Correct 1629 ms 18212 KB Output is correct
39 Correct 1237 ms 18204 KB Output is correct
40 Correct 861 ms 17492 KB Output is correct
41 Correct 1217 ms 18296 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 7260 KB Output is correct
4 Correct 1 ms 5212 KB Output is correct
5 Correct 1 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 1 ms 7260 KB Output is correct
8 Correct 1 ms 7260 KB Output is correct
9 Correct 1 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 4 ms 9308 KB Output is correct
12 Correct 5 ms 11356 KB Output is correct
13 Correct 7 ms 11356 KB Output is correct
14 Correct 9 ms 11356 KB Output is correct
15 Correct 7 ms 11356 KB Output is correct
16 Correct 10 ms 11356 KB Output is correct
17 Correct 9 ms 11352 KB Output is correct
18 Correct 8 ms 11356 KB Output is correct
19 Runtime error 19 ms 9052 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -