oj.uz

Submission #167444

# Submission time Handle Problem Language Result Execution time Memory
167444 2019-12-08T15:09:00 Z tincamatei Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
0 / 100
 2189 ms 108464 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000000;
int aint[1+4*MAX_N];

void update(int poz, int val, int l = 1, int r = MAX_N, int nod = 1) {
	if(poz < l || r < poz) return;
	
	if(l == r)
		aint[nod] = max(aint[nod], val);
	else {
		int mid = (l + r) / 2;
		update(poz, val, l, mid, 2 * nod);
		update(poz, val, mid + 1, r, 2 * nod + 1);
		aint[nod] = max(aint[2 * nod], aint[2 * nod + 1]);
	}
}

int query(int i, int j, int l = 1, int r = MAX_N, int nod = 1) {
	if(j < l || r < i || j < i) return -1;

	if(i <= l && r <= j)
		return aint[nod];
	else {
		int mid = (l + r) / 2;
		return max(query(i, j, l, mid, 2 * nod),
		           query(i, j, mid + 1, r, 2 * nod + 1));
	}
}

int v[1+MAX_N];
int stiva[1+MAX_N], top;
int nextBigger[1+MAX_N];
bool rez[1+MAX_N];

struct Query {
	int l, r, k;
	bool *rez;
};
vector<Query> queryBucket[1+MAX_N];

int main() {
	int N, M;
	scanf("%d%d", &N, &M);
	for(int i = 1; i <= N; ++i) {
		scanf("%d", &v[i]);
		while(top > 0 && v[stiva[top - 1]] < v[i])
			--top;

		if(top > 0)
			nextBigger[i] = stiva[top - 1];
		stiva[top++] = i;
	}

	for(int i = 0; i < M; ++i) {
		int l, r, k;
		scanf("%d%d%d", &l, &r, &k);
		queryBucket[r].push_back({l, r, k, &rez[i]});
	}

	for(int i = 1; i <= N; ++i) {
		if(nextBigger[i] != 0)
			update(nextBigger[i], v[i] + v[nextBigger[i]]);
	
		for(auto it: queryBucket[i]) {
			if(query(it.l, it.r) <= it.k)
				*it.rez = true;
			else
				*it.rez = false;
		}
	}

	for(int i = 0; i < M; ++i)
		printf("%d\n", rez[i]);

	return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &v[i]);
   ~~~~~^~~~~~~~~~~~~
sortbooks.cpp:59:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &l, &r, &k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 23928 KB Output is correct
2 Correct 25 ms 23672 KB Output is correct
3 Correct 59 ms 23928 KB Output is correct
4 Correct 26 ms 23928 KB Output is correct
5 Correct 25 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 26 ms 23928 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23928 KB Output is correct
10 Incorrect 25 ms 23928 KB Output isn't correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 23928 KB Output is correct
2 Correct 25 ms 23672 KB Output is correct
3 Correct 59 ms 23928 KB Output is correct
4 Correct 26 ms 23928 KB Output is correct
5 Correct 25 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 26 ms 23928 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23928 KB Output is correct
10 Incorrect 25 ms 23928 KB Output isn't correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2080 ms 106016 KB Output is correct
2 Correct 2125 ms 107976 KB Output is correct
3 Correct 2189 ms 108216 KB Output is correct
4 Correct 2059 ms 108464 KB Output is correct
5 Incorrect 1818 ms 108424 KB Output isn't correct

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 23928 KB Output is correct
2 Correct 25 ms 23672 KB Output is correct
3 Correct 59 ms 23928 KB Output is correct
4 Correct 26 ms 23928 KB Output is correct
5 Correct 25 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 26 ms 23928 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23928 KB Output is correct
10 Incorrect 25 ms 23928 KB Output isn't correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 23928 KB Output is correct
2 Correct 25 ms 23672 KB Output is correct
3 Correct 59 ms 23928 KB Output is correct
4 Correct 26 ms 23928 KB Output is correct
5 Correct 25 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 26 ms 23928 KB Output is correct
8 Correct 25 ms 23928 KB Output is correct
9 Correct 25 ms 23928 KB Output is correct
10 Incorrect 25 ms 23928 KB Output isn't correct