oj.uz

답안 #543494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543494 2022-03-30T18:19:15 Z fuad27 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 156 ms 9188 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
#define ff first
#define ss second
ll fen[N];
ll arr[N];
void upd(int at, ll val) {
	at++;
	while(at < N) {
		fen[at] = max(fen[at], val);
		at+=at&(-at);
	}
}
ll get(int r) {
	r++;
	ll mx = 0;
	while(r > 0) {
		mx = max(mx, fen[r]);
		r-=r&(-r);
	}
	return mx;
}
int main () {
	int n, m;
	cin >> n >> m;
	for(int i = 0;i<N;i++)fen[i] = 0;
	for(int i = 1;i<=n;i++)cin >> arr[i];
	vector<pair<pair<ll,ll>, ll>> que[n+1];
	for(int i = 0;i<m;i++) {
		ll l, r, v;
		cin >> l >> r >> v;
		que[r].push_back(make_pair(make_pair(l, v), i));
	}
	ll ans[m];
	vector<int> stk;
	stk.push_back(0);
	for(int i = 1;i<=n;i++) {
		while(stk.size() and arr[stk.back()] <= arr[i])stk.pop_back();
		if(stk.size())upd(stk.back(), arr[stk.back()]+arr[i]);
		stk.push_back(i);
		for(auto q:que[i]) {
			ans[q.ss] = (get(q.ff.ff) <= q.ff.ss);
		}
	}
	for(int i = 0;i<m;i++)cout << ans[i] << "\n";
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 2 ms 1876 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 2 ms 1876 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 156 ms 6644 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 124 ms 9188 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 2 ms 1876 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 2 ms 1876 KB Output isn't correct
4 Halted 0 ms 0 KB -