Submission #155491

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
155491	2019-09-28T18:53:54 Z	qkxwsm	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3000 ms	96576 KB

sortbooks

#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 pos[MAXN];
int sparse[20][MAXN];
vector<ppp> queries;
bitset<MAXN> ans;

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

bool cmp(ppp a, ppp b)
{
	return a.fi.se < b.fi.se;
}
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;
	int mxv = 0, mnw = 1000000013, mxw = 0;
	FOR(i, 0, N)
	{
		cin >> arr[i];
		ckmin(mnw, arr[i]);
		ckmax(mxw, arr[i]);
	}
	FOR(i, 0, Q)
	{
		int l, r, v; cin >> l >> r >> v; l--; r--; ckmax(mxv, v);
		queries.PB({{l, r}, {v, 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))]);
		}
	}
	if (N >= 5000)
	{
		//subtask 1, 2
		FOR(i, 0, Q)
		{
			int l = queries[i].fi.fi, r = queries[i].fi.se, v = queries[i].se.fi, qid = queries[i].se.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;
				}
			}
		}
	}
	else if (mxw <= 1000)
	{
		//subtask 4
		sort(ALL(queries), cmp);
		int iter = 0;
		//store rightmost positino of each #
		FOR(i, 0, 1001) pos[i] = -1;
		FOR(i, 0, N)
		{
			pos[arr[i]] = i;
			while(iter < Q && queries[iter].fi.se == i)
			{
				int l = queries[iter].fi.fi, r = queries[iter].fi.se, v = queries[iter].se.fi, qid = queries[iter].se.se;
				FOR(j, 0, 1001)
				{
					int x = pos[j];
					if (x <= l) continue;
					int mx = query(l, x - 1);
					if (mx > j && mx + j > v)
					{
						ans[qid] = true;
						break;
					}
				}
				iter++;
			}
		}
	}
	else if (mxv < mnw)
	{
		//subtask 3
		//you just need to figure out if it's <= here or not.
		pos[N - 1] = N - 1;
		FORD(i, N - 1, 0)
		{
			pos[i] = (arr[i + 1] < arr[i] ? i : pos[i + 1]);
		}
		FOR(i, 0, Q)
		{
			int l = queries[i].fi.fi, r = queries[i].fi.se, v = queries[i].se.fi, qid = queries[i].se.se;
			ans[qid] = (pos[l] < r);
		}
	}
	//left, right, value, qid;
	FOR(i, 0, Q)
	{
		cout << (ans[i] ? 0 : 1) << '\n';
	}
}

Compilation message

sortbooks.cpp: In function 'int32_t main()':
sortbooks.cpp:113:34: warning: unused variable 'r' [-Wunused-variable]
     int l = queries[iter].fi.fi, r = queries[iter].fi.se, v = queries[iter].se.fi, qid = queries[iter].se.se;
                                  ^
sortbooks.cpp:140:52: warning: unused variable 'v' [-Wunused-variable]
    int l = queries[i].fi.fi, r = queries[i].fi.se, v = queries[i].se.fi, qid = queries[i].se.se;
                                                    ^

Subtask #1
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	Incorrect	2 ms	376 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2
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	Incorrect	2 ms	376 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	781 ms	96496 KB	Output is correct
2	Correct	729 ms	96448 KB	Output is correct
3	Correct	734 ms	96544 KB	Output is correct
4	Correct	737 ms	96576 KB	Output is correct
5	Execution timed out	3051 ms	94272 KB	Time limit exceeded