oj.uz

Submission #155483

# Submission time Handle Problem Language Result Execution time Memory
155483 2019-09-28T18:27:14 Z qkxwsm Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
17 / 100
 3000 ms 129296 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}
template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) ((x).size()))
#define ALL(x) (x).begin(), (x).end()
#define MAXN 1000013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef pair<pii, pii> ppp;

int N, Q;
int arr[MAXN];
int sparse[20][MAXN];
vector<ppp> queries;
bitset<MAXN> ans;

//max (a[i] + a[j]) such that a[i] > a[j]

int query(int l, int r)
{
	int sz = 31 - __builtin_clz(r - l + 1);
	return max(sparse[sz][l], sparse[sz][r - (1 << sz) + 1]);
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> Q;
	FOR(i, 0, N)
	{
		cin >> arr[i];
	}
	FOR(i, 0, N)
	{
		sparse[0][i] = arr[i];
	}
	FOR(i, 1, 20)
	{
		FOR(j, 0, N - (1 << i))
		{
			sparse[i][j] = max(sparse[i - 1][j], sparse[i - 1][j + (1 << (i - 1))]);
		}
	}
	FOR(i, 0, Q)
	{
		int l, r, v; cin >> l >> r >> v; l--; r--;
		queries.PB({{l, r}, {v, i}});
	}
	//left, right, value, qid;
	FOR(i, 0, Q)
	{
		int qid = queries[i].se.se, v = queries[i].se.fi, l = queries[i].fi.fi, r = queries[i].fi.se;
		FOR(j, l + 1, r + 1)
		{
			int mx = query(l, j - 1);
			if (mx > arr[j] && mx + arr[j] > v)
			{
				ans[qid] = true;
				break;
			}
		}
	}
	FOR(i, 0, Q)
	{
		cout << (ans[i] ? 0 : 1) << '\n';
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 508 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 508 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 4 ms 892 KB Output is correct
13 Correct 5 ms 888 KB Output is correct
14 Correct 6 ms 1016 KB Output is correct
15 Correct 6 ms 1016 KB Output is correct
16 Correct 38 ms 1048 KB Output is correct
17 Correct 39 ms 888 KB Output is correct
18 Correct 34 ms 1016 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 737 ms 128212 KB Output is correct
2 Correct 741 ms 129284 KB Output is correct
3 Correct 734 ms 129112 KB Output is correct
4 Correct 741 ms 129296 KB Output is correct
5 Execution timed out 3046 ms 127168 KB Time limit exceeded

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1832 ms 11012 KB Output is correct
2 Execution timed out 3044 ms 10864 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 508 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 4 ms 892 KB Output is correct
13 Correct 5 ms 888 KB Output is correct
14 Correct 6 ms 1016 KB Output is correct
15 Correct 6 ms 1016 KB Output is correct
16 Correct 38 ms 1048 KB Output is correct
17 Correct 39 ms 888 KB Output is correct
18 Correct 34 ms 1016 KB Output is correct
19 Execution timed out 3058 ms 24260 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 508 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 4 ms 892 KB Output is correct
13 Correct 5 ms 888 KB Output is correct
14 Correct 6 ms 1016 KB Output is correct
15 Correct 6 ms 1016 KB Output is correct
16 Correct 38 ms 1048 KB Output is correct
17 Correct 39 ms 888 KB Output is correct
18 Correct 34 ms 1016 KB Output is correct
19 Correct 737 ms 128212 KB Output is correct
20 Correct 741 ms 129284 KB Output is correct
21 Correct 734 ms 129112 KB Output is correct
22 Correct 741 ms 129296 KB Output is correct
23 Execution timed out 3046 ms 127168 KB Time limit exceeded