oj.uz

답안 #497494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497494 2021-12-23T07:12:09 Z vinnipuh01 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 604 ms 262144 KB 
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
 
using namespace std;
 
const long long oo = 1000000000000000000;
 
long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
 
 
/*
    ViHHiPuh
 
   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))
 
 
    cout << fixed << setprecision(6) << x;
 
 
    freopen ( "sum.in", "r", stdin )
*/
 
struct Node {
	vector <int> v;
	int ans;
	public :
		Node operator + ( Node a ) {
			Node c;
			c.ans = max( ans, a.ans );
			int l, r;
			l = r = 0;
			int mx = v.back();
			if ( a.v.front() < mx ) {
				auto it = lower_bound( a.v.begin(), a.v.end(), mx );
				it = --it;
				c.ans = max( c.ans, *it + mx );
			}
			while ( l < v.size() && r < a.v.size() ) {
				if ( v[ l ] < a.v[ r ] ) {
					c.v.push_back( v[ l ] );
					l ++;
				}
				else {
					c.v.push_back( a.v[ r ] );
					r ++;
				}
			}
			while ( l < v.size() ) {
				c.v.push_back( v[ l ] );
				l ++;
			}
			while ( r < a.v.size() ) {
				c.v.push_back( a.v[ r ] );
				r ++;
			}
			return c;
		}
} t[ 2000001 ];

struct Node1 {
	int ans, mx;
} an;
 
int n, m, a[ 1000001 ];
 
void build( int v, int tl, int tr ) {
	if ( tl == tr ) {
		t[ v ].v.push_back( a[ tl ] );
		t[ v ].ans = 0;
		return;
	}
	int mid = ( tl + tr ) / 2;
	build( v + v, tl, mid );
	build( v + v + 1, mid + 1, tr );
	t[ v ] = t[ v + v ] + t[ v + v + 1 ];
}
 
void gett( int v, int tl, int tr, int l, int r ) {
	if ( tl > r || tr < l )
		return;
	if ( tl >= l && tr <= r ) {
		an.ans = max( an.ans, t[ v ].ans );
		if ( an.mx > t[ v ].v.front() ) {
			auto it = lower_bound( t[ v ].v.begin(), t[ v ].v.end(), an.mx );
			it = --it;
			an.ans = max( an.ans, an.mx + *it );
		}
		an.mx = max( an.mx, t[ v ].v.back() );
		return;
	}
	int mid = ( tl + tr ) / 2;
	gett( v + v, tl, mid, l, r );
	gett( v + v + 1, mid + 1, tr, l, r );
}
 
main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for ( int i = 1; i <= n; i ++ ) {
		cin >> a[ i ];
	}
	int l, r, x;
	build( 1, 1, n );
	while ( m -- ) {
		cin >> l >> r >> x;
		num = 0;
		an.mx = 0;
		an.ans = 0;
		gett( 1, 1, n, l, r );
		cout << ( x >= an.ans ) << "\n";
	}
}

/*
9 1
10 6 7 10 1 3 7 3 7 
2 3 1

3 1 
7 1 9
1 3 8

*/

Compilation message

sortbooks.cpp: In member function 'Node Node::operator+(Node)':
sortbooks.cpp:58:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |    while ( l < v.size() && r < a.v.size() ) {
      |            ~~^~~~~~~~~~
sortbooks.cpp:58:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |    while ( l < v.size() && r < a.v.size() ) {
      |                            ~~^~~~~~~~~~~~
sortbooks.cpp:68:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |    while ( l < v.size() ) {
      |            ~~^~~~~~~~~~
sortbooks.cpp:72:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    while ( r < a.v.size() ) {
      |            ~~^~~~~~~~~~~~
sortbooks.cpp: At global scope:
sortbooks.cpp:116:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  116 | main () {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 62916 KB Output is correct
2 Correct 29 ms 62852 KB Output is correct
3 Correct 30 ms 62840 KB Output is correct
4 Correct 31 ms 62892 KB Output is correct
5 Correct 30 ms 62924 KB Output is correct
6 Correct 31 ms 62888 KB Output is correct
7 Correct 30 ms 62944 KB Output is correct
8 Correct 32 ms 62924 KB Output is correct
9 Correct 30 ms 63020 KB Output is correct
10 Correct 36 ms 62932 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 62916 KB Output is correct
2 Correct 29 ms 62852 KB Output is correct
3 Correct 30 ms 62840 KB Output is correct
4 Correct 31 ms 62892 KB Output is correct
5 Correct 30 ms 62924 KB Output is correct
6 Correct 31 ms 62888 KB Output is correct
7 Correct 30 ms 62944 KB Output is correct
8 Correct 32 ms 62924 KB Output is correct
9 Correct 30 ms 63020 KB Output is correct
10 Correct 36 ms 62932 KB Output is correct
11 Correct 37 ms 63044 KB Output is correct
12 Correct 34 ms 63612 KB Output is correct
13 Correct 35 ms 63564 KB Output is correct
14 Correct 36 ms 63604 KB Output is correct
15 Correct 37 ms 63628 KB Output is correct
16 Correct 35 ms 63556 KB Output is correct
17 Correct 34 ms 63400 KB Output is correct
18 Correct 36 ms 63632 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 604 ms 262144 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 76780 KB Output is correct
2 Correct 186 ms 76844 KB Output is correct
3 Correct 171 ms 76728 KB Output is correct
4 Correct 166 ms 76720 KB Output is correct
5 Correct 187 ms 76908 KB Output is correct
6 Correct 150 ms 76804 KB Output is correct
7 Correct 125 ms 76836 KB Output is correct
8 Correct 150 ms 76824 KB Output is correct
9 Correct 78 ms 63172 KB Output is correct
10 Correct 150 ms 76800 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 62916 KB Output is correct
2 Correct 29 ms 62852 KB Output is correct
3 Correct 30 ms 62840 KB Output is correct
4 Correct 31 ms 62892 KB Output is correct
5 Correct 30 ms 62924 KB Output is correct
6 Correct 31 ms 62888 KB Output is correct
7 Correct 30 ms 62944 KB Output is correct
8 Correct 32 ms 62924 KB Output is correct
9 Correct 30 ms 63020 KB Output is correct
10 Correct 36 ms 62932 KB Output is correct
11 Correct 37 ms 63044 KB Output is correct
12 Correct 34 ms 63612 KB Output is correct
13 Correct 35 ms 63564 KB Output is correct
14 Correct 36 ms 63604 KB Output is correct
15 Correct 37 ms 63628 KB Output is correct
16 Correct 35 ms 63556 KB Output is correct
17 Correct 34 ms 63400 KB Output is correct
18 Correct 36 ms 63632 KB Output is correct
19 Correct 469 ms 91884 KB Output is correct
20 Correct 474 ms 91940 KB Output is correct
21 Correct 382 ms 91860 KB Output is correct
22 Correct 433 ms 91880 KB Output is correct
23 Correct 390 ms 91896 KB Output is correct
24 Correct 250 ms 91820 KB Output is correct
25 Correct 249 ms 91836 KB Output is correct
26 Correct 332 ms 91792 KB Output is correct
27 Correct 320 ms 91948 KB Output is correct
28 Correct 380 ms 91788 KB Output is correct
29 Correct 350 ms 91784 KB Output is correct
30 Correct 376 ms 91792 KB Output is correct
31 Correct 348 ms 91952 KB Output is correct
32 Correct 366 ms 91936 KB Output is correct
33 Correct 363 ms 91892 KB Output is correct
34 Correct 288 ms 91876 KB Output is correct
35 Correct 294 ms 91788 KB Output is correct
36 Correct 280 ms 91832 KB Output is correct
37 Correct 271 ms 91768 KB Output is correct
38 Correct 270 ms 91844 KB Output is correct
39 Correct 375 ms 91816 KB Output is correct
40 Correct 240 ms 79392 KB Output is correct
41 Correct 330 ms 91828 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 62916 KB Output is correct
2 Correct 29 ms 62852 KB Output is correct
3 Correct 30 ms 62840 KB Output is correct
4 Correct 31 ms 62892 KB Output is correct
5 Correct 30 ms 62924 KB Output is correct
6 Correct 31 ms 62888 KB Output is correct
7 Correct 30 ms 62944 KB Output is correct
8 Correct 32 ms 62924 KB Output is correct
9 Correct 30 ms 63020 KB Output is correct
10 Correct 36 ms 62932 KB Output is correct
11 Correct 37 ms 63044 KB Output is correct
12 Correct 34 ms 63612 KB Output is correct
13 Correct 35 ms 63564 KB Output is correct
14 Correct 36 ms 63604 KB Output is correct
15 Correct 37 ms 63628 KB Output is correct
16 Correct 35 ms 63556 KB Output is correct
17 Correct 34 ms 63400 KB Output is correct
18 Correct 36 ms 63632 KB Output is correct
19 Runtime error 604 ms 262144 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -