Submission #651211

# Submission time Handle Problem Language Result Execution time Memory
651211 2022-10-18T02:55:29 Z lemonislemon Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
17 / 100
16 ms 468 KB
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 5005;
int w[MAXN];
void solve() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> w[i];	
	}
	for(int i = 1; i <= m; ++i) {
		int l, r, k;
		cin >> l >> r >> k;
		int summx = 0;
		int mx = 0;
		for(int j = l; j <= r; ++j) {
			int val = w[j];
			if(val < mx) summx = max(summx, val + mx);  
			else mx = val;
		}
		if(summx > k) cout << "0\n";
		else cout << "1\n";	
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	solve();
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 12 ms 340 KB Output is correct
15 Correct 11 ms 340 KB Output is correct
16 Correct 15 ms 340 KB Output is correct
17 Correct 9 ms 340 KB Output is correct
18 Correct 16 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 12 ms 340 KB Output is correct
15 Correct 11 ms 340 KB Output is correct
16 Correct 15 ms 340 KB Output is correct
17 Correct 9 ms 340 KB Output is correct
18 Correct 16 ms 340 KB Output is correct
19 Runtime error 1 ms 468 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 7 ms 340 KB Output is correct
13 Correct 8 ms 348 KB Output is correct
14 Correct 12 ms 340 KB Output is correct
15 Correct 11 ms 340 KB Output is correct
16 Correct 15 ms 340 KB Output is correct
17 Correct 9 ms 340 KB Output is correct
18 Correct 16 ms 340 KB Output is correct
19 Runtime error 1 ms 468 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -