oj.uz

Submission #571433

# Submission time Handle Problem Language Result Execution time Memory
571433 2022-06-02T08:06:46 Z AzamatRustamov Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 2719 ms 20488 KB 
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n, m;
	cin >> n >> m;
	int w[n];
	for (int i=0; i<n; i++) 
		cin >> w[i];
	while (m--)
	{
		int l, r, k, x, y=1;
		cin >> l >> r >> k;
		x = w[l];
		for (int i=l+1; i<=r; i++)
		{
			if (x > w[i] && x + w[i] > k)
			{
				y = 0;
				break;
			}
			else if (x < w[i]) x = w[i];
		}
		cout << y << '\n';
	}
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -