oj.uz

답안 #497541

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497541 2021-12-23T08:23:05 Z vinnipuh01 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 1121 ms 163748 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[ 4000001 ];
 
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 );
}

struct Node2 {
	int mn, mx, inv;
	public :
		Node2 operator + ( Node2 a ) {
			Node2 c;
			c.inv = max( inv, a.inv );
			if ( a.mn < mx )
				c.inv = 1;
			c.mn = min( mn, a.mn );
			c.mx = max( mx, a.mx );
			return c;
		}
} t1[ 4000001 ];
 
void build1( int v, int tl, int tr ) {
	if ( tl == tr ) {
		t1[ v ].mn = a[ tl ];
		t1[ v ].mx = a[ tl ];
		t1[ v ].inv = 0;
		return;
	}
	int mid = ( tl + tr ) / 2;
	build1( v + v, tl, mid );
	build1( v + v + 1, mid + 1, tr );
	t1[ v ] = t1[ v + v ] + t1[ v + v + 1 ];
}
 
void gett1( int v, int tl, int tr, int l, int r ) {
	if ( tl > r || tr < l )
		return;
	if ( tl >= l && tr <= r ) {
		if ( t1[ v ].mn < mx || t1[ v ].inv )
			num = 1;
		mx = max( mx, t1[ v ].mx + 0ll );
		return;
	}
	int mid = ( tl + tr ) / 2;
	gett1( v + v, tl, mid, l, r );
	gett1( 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;
	if ( n <= 2e5 && m <= 2e5 )
		build( 1, 1, n );
	else
		build1( 1, 1, n );
	while ( m -- ) {
		cin >> l >> r >> x;
		if ( n <= 2e5 && m <= 2e5 ) {
			num = 0;
			an.mx = 0;
			an.ans = 0;
			gett( 1, 1, n, l, r );
			cout << ( x >= an.ans ) << "\n";
		}
		else {
			num = 0;
			mx = -1;
			gett1( 1, 1, n, l, r );
			cout << !num << "\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:157:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  157 | main () {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 125548 KB Output is correct
2 Correct 65 ms 125436 KB Output is correct
3 Correct 69 ms 125572 KB Output is correct
4 Correct 65 ms 125644 KB Output is correct
5 Correct 71 ms 125464 KB Output is correct
6 Correct 82 ms 125596 KB Output is correct
7 Correct 73 ms 125552 KB Output is correct
8 Correct 71 ms 125504 KB Output is correct
9 Correct 66 ms 125536 KB Output is correct
10 Correct 59 ms 125508 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 125548 KB Output is correct
2 Correct 65 ms 125436 KB Output is correct
3 Correct 69 ms 125572 KB Output is correct
4 Correct 65 ms 125644 KB Output is correct
5 Correct 71 ms 125464 KB Output is correct
6 Correct 82 ms 125596 KB Output is correct
7 Correct 73 ms 125552 KB Output is correct
8 Correct 71 ms 125504 KB Output is correct
9 Correct 66 ms 125536 KB Output is correct
10 Correct 59 ms 125508 KB Output is correct
11 Correct 61 ms 125632 KB Output is correct
12 Correct 81 ms 126164 KB Output is correct
13 Correct 62 ms 126212 KB Output is correct
14 Correct 65 ms 126148 KB Output is correct
15 Correct 77 ms 126244 KB Output is correct
16 Correct 65 ms 126184 KB Output is correct
17 Correct 77 ms 125912 KB Output is correct
18 Correct 75 ms 126244 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1121 ms 156172 KB Output is correct
2 Correct 1049 ms 156068 KB Output is correct
3 Correct 1090 ms 156072 KB Output is correct
4 Correct 1113 ms 156236 KB Output is correct
5 Correct 1012 ms 156136 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 254 ms 139460 KB Output is correct
2 Correct 251 ms 139408 KB Output is correct
3 Correct 191 ms 139348 KB Output is correct
4 Correct 219 ms 139360 KB Output is correct
5 Correct 199 ms 139508 KB Output is correct
6 Correct 190 ms 139452 KB Output is correct
7 Correct 158 ms 139400 KB Output is correct
8 Correct 193 ms 139424 KB Output is correct
9 Correct 105 ms 125780 KB Output is correct
10 Correct 189 ms 139400 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 125548 KB Output is correct
2 Correct 65 ms 125436 KB Output is correct
3 Correct 69 ms 125572 KB Output is correct
4 Correct 65 ms 125644 KB Output is correct
5 Correct 71 ms 125464 KB Output is correct
6 Correct 82 ms 125596 KB Output is correct
7 Correct 73 ms 125552 KB Output is correct
8 Correct 71 ms 125504 KB Output is correct
9 Correct 66 ms 125536 KB Output is correct
10 Correct 59 ms 125508 KB Output is correct
11 Correct 61 ms 125632 KB Output is correct
12 Correct 81 ms 126164 KB Output is correct
13 Correct 62 ms 126212 KB Output is correct
14 Correct 65 ms 126148 KB Output is correct
15 Correct 77 ms 126244 KB Output is correct
16 Correct 65 ms 126184 KB Output is correct
17 Correct 77 ms 125912 KB Output is correct
18 Correct 75 ms 126244 KB Output is correct
19 Correct 573 ms 154512 KB Output is correct
20 Correct 528 ms 154428 KB Output is correct
21 Correct 424 ms 154516 KB Output is correct
22 Correct 450 ms 154420 KB Output is correct
23 Correct 408 ms 154540 KB Output is correct
24 Correct 307 ms 154408 KB Output is correct
25 Correct 298 ms 154492 KB Output is correct
26 Correct 372 ms 154448 KB Output is correct
27 Correct 418 ms 154464 KB Output is correct
28 Correct 365 ms 154520 KB Output is correct
29 Correct 360 ms 154536 KB Output is correct
30 Correct 395 ms 154504 KB Output is correct
31 Correct 374 ms 154504 KB Output is correct
32 Correct 472 ms 154516 KB Output is correct
33 Correct 370 ms 154428 KB Output is correct
34 Correct 320 ms 154520 KB Output is correct
35 Correct 323 ms 154456 KB Output is correct
36 Correct 275 ms 154544 KB Output is correct
37 Correct 278 ms 154692 KB Output is correct
38 Correct 295 ms 154416 KB Output is correct
39 Correct 366 ms 154660 KB Output is correct
40 Correct 247 ms 142088 KB Output is correct
41 Correct 333 ms 154464 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 125548 KB Output is correct
2 Correct 65 ms 125436 KB Output is correct
3 Correct 69 ms 125572 KB Output is correct
4 Correct 65 ms 125644 KB Output is correct
5 Correct 71 ms 125464 KB Output is correct
6 Correct 82 ms 125596 KB Output is correct
7 Correct 73 ms 125552 KB Output is correct
8 Correct 71 ms 125504 KB Output is correct
9 Correct 66 ms 125536 KB Output is correct
10 Correct 59 ms 125508 KB Output is correct
11 Correct 61 ms 125632 KB Output is correct
12 Correct 81 ms 126164 KB Output is correct
13 Correct 62 ms 126212 KB Output is correct
14 Correct 65 ms 126148 KB Output is correct
15 Correct 77 ms 126244 KB Output is correct
16 Correct 65 ms 126184 KB Output is correct
17 Correct 77 ms 125912 KB Output is correct
18 Correct 75 ms 126244 KB Output is correct
19 Correct 1121 ms 156172 KB Output is correct
20 Correct 1049 ms 156068 KB Output is correct
21 Correct 1090 ms 156072 KB Output is correct
22 Correct 1113 ms 156236 KB Output is correct
23 Correct 1012 ms 156136 KB Output is correct
24 Correct 254 ms 139460 KB Output is correct
25 Correct 251 ms 139408 KB Output is correct
26 Correct 191 ms 139348 KB Output is correct
27 Correct 219 ms 139360 KB Output is correct
28 Correct 199 ms 139508 KB Output is correct
29 Correct 190 ms 139452 KB Output is correct
30 Correct 158 ms 139400 KB Output is correct
31 Correct 193 ms 139424 KB Output is correct
32 Correct 105 ms 125780 KB Output is correct
33 Correct 189 ms 139400 KB Output is correct
34 Correct 573 ms 154512 KB Output is correct
35 Correct 528 ms 154428 KB Output is correct
36 Correct 424 ms 154516 KB Output is correct
37 Correct 450 ms 154420 KB Output is correct
38 Correct 408 ms 154540 KB Output is correct
39 Correct 307 ms 154408 KB Output is correct
40 Correct 298 ms 154492 KB Output is correct
41 Correct 372 ms 154448 KB Output is correct
42 Correct 418 ms 154464 KB Output is correct
43 Correct 365 ms 154520 KB Output is correct
44 Correct 360 ms 154536 KB Output is correct
45 Correct 395 ms 154504 KB Output is correct
46 Correct 374 ms 154504 KB Output is correct
47 Correct 472 ms 154516 KB Output is correct
48 Correct 370 ms 154428 KB Output is correct
49 Correct 320 ms 154520 KB Output is correct
50 Correct 323 ms 154456 KB Output is correct
51 Correct 275 ms 154544 KB Output is correct
52 Correct 278 ms 154692 KB Output is correct
53 Correct 295 ms 154416 KB Output is correct
54 Correct 366 ms 154660 KB Output is correct
55 Correct 247 ms 142088 KB Output is correct
56 Correct 333 ms 154464 KB Output is correct
57 Incorrect 1077 ms 163748 KB Output isn't correct
58 Halted 0 ms 0 KB -