oj.uz

답안 #155490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155490 2019-09-28T18:44:34 Z qkxwsm Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
30 / 100
 741 ms 100452 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 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;
	FOR(i, 0, N)
	{
		cin >> 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 (mxv <= 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
	{
		//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:111: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:139: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
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 5 ms 888 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 1060 KB Output is correct
16 Correct 38 ms 1016 KB Output is correct
17 Correct 39 ms 932 KB Output is correct
18 Correct 35 ms 1016 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 100292 KB Output is correct
2 Correct 720 ms 100452 KB Output is correct
3 Correct 741 ms 100424 KB Output is correct
4 Correct 729 ms 100412 KB Output is correct
5 Correct 699 ms 100348 KB Output is correct

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 5 ms 888 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 1060 KB Output is correct
16 Correct 38 ms 1016 KB Output is correct
17 Correct 39 ms 932 KB Output is correct
18 Correct 35 ms 1016 KB Output is correct
19 Incorrect 150 ms 20032 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 5 ms 888 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 1060 KB Output is correct
16 Correct 38 ms 1016 KB Output is correct
17 Correct 39 ms 932 KB Output is correct
18 Correct 35 ms 1016 KB Output is correct
19 Correct 709 ms 100292 KB Output is correct
20 Correct 720 ms 100452 KB Output is correct
21 Correct 741 ms 100424 KB Output is correct
22 Correct 729 ms 100412 KB Output is correct
23 Correct 699 ms 100348 KB Output is correct
24 Incorrect 59 ms 10496 KB Output isn't correct
25 Halted 0 ms 0 KB -