oj.uz

답안 #497538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497538 2021-12-23T08:22:02 Z vinnipuh01 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 541 ms 248684 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[ 3000001 ];
 
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;
			gett( 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 51 ms 94148 KB Output is correct
2 Correct 53 ms 94192 KB Output is correct
3 Correct 45 ms 94248 KB Output is correct
4 Correct 46 ms 94172 KB Output is correct
5 Correct 46 ms 94264 KB Output is correct
6 Correct 45 ms 94276 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 44 ms 94164 KB Output is correct
9 Correct 57 ms 94236 KB Output is correct
10 Correct 46 ms 94248 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 94148 KB Output is correct
2 Correct 53 ms 94192 KB Output is correct
3 Correct 45 ms 94248 KB Output is correct
4 Correct 46 ms 94172 KB Output is correct
5 Correct 46 ms 94264 KB Output is correct
6 Correct 45 ms 94276 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 44 ms 94164 KB Output is correct
9 Correct 57 ms 94236 KB Output is correct
10 Correct 46 ms 94248 KB Output is correct
11 Correct 46 ms 94420 KB Output is correct
12 Correct 47 ms 94868 KB Output is correct
13 Correct 55 ms 94880 KB Output is correct
14 Correct 62 ms 94832 KB Output is correct
15 Correct 53 ms 94864 KB Output is correct
16 Correct 50 ms 94956 KB Output is correct
17 Correct 49 ms 94628 KB Output is correct
18 Correct 51 ms 94864 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 233 ms 108108 KB Output is correct
2 Correct 221 ms 108152 KB Output is correct
3 Correct 188 ms 108048 KB Output is correct
4 Correct 166 ms 108112 KB Output is correct
5 Correct 216 ms 108136 KB Output is correct
6 Correct 162 ms 108148 KB Output is correct
7 Correct 139 ms 108132 KB Output is correct
8 Correct 201 ms 108196 KB Output is correct
9 Correct 94 ms 94500 KB Output is correct
10 Correct 160 ms 108052 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 94148 KB Output is correct
2 Correct 53 ms 94192 KB Output is correct
3 Correct 45 ms 94248 KB Output is correct
4 Correct 46 ms 94172 KB Output is correct
5 Correct 46 ms 94264 KB Output is correct
6 Correct 45 ms 94276 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 44 ms 94164 KB Output is correct
9 Correct 57 ms 94236 KB Output is correct
10 Correct 46 ms 94248 KB Output is correct
11 Correct 46 ms 94420 KB Output is correct
12 Correct 47 ms 94868 KB Output is correct
13 Correct 55 ms 94880 KB Output is correct
14 Correct 62 ms 94832 KB Output is correct
15 Correct 53 ms 94864 KB Output is correct
16 Correct 50 ms 94956 KB Output is correct
17 Correct 49 ms 94628 KB Output is correct
18 Correct 51 ms 94864 KB Output is correct
19 Correct 541 ms 123128 KB Output is correct
20 Correct 527 ms 123220 KB Output is correct
21 Correct 416 ms 123656 KB Output is correct
22 Correct 394 ms 123568 KB Output is correct
23 Correct 462 ms 123540 KB Output is correct
24 Correct 280 ms 123608 KB Output is correct
25 Correct 281 ms 123472 KB Output is correct
26 Correct 379 ms 123508 KB Output is correct
27 Correct 350 ms 123556 KB Output is correct
28 Correct 352 ms 123536 KB Output is correct
29 Correct 353 ms 123704 KB Output is correct
30 Correct 359 ms 123468 KB Output is correct
31 Correct 389 ms 123572 KB Output is correct
32 Correct 365 ms 123552 KB Output is correct
33 Correct 385 ms 123516 KB Output is correct
34 Correct 280 ms 123464 KB Output is correct
35 Correct 279 ms 123444 KB Output is correct
36 Correct 271 ms 123484 KB Output is correct
37 Correct 269 ms 123532 KB Output is correct
38 Correct 270 ms 123480 KB Output is correct
39 Correct 353 ms 123680 KB Output is correct
40 Correct 263 ms 111148 KB Output is correct
41 Correct 318 ms 123552 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 94148 KB Output is correct
2 Correct 53 ms 94192 KB Output is correct
3 Correct 45 ms 94248 KB Output is correct
4 Correct 46 ms 94172 KB Output is correct
5 Correct 46 ms 94264 KB Output is correct
6 Correct 45 ms 94276 KB Output is correct
7 Correct 46 ms 94212 KB Output is correct
8 Correct 44 ms 94164 KB Output is correct
9 Correct 57 ms 94236 KB Output is correct
10 Correct 46 ms 94248 KB Output is correct
11 Correct 46 ms 94420 KB Output is correct
12 Correct 47 ms 94868 KB Output is correct
13 Correct 55 ms 94880 KB Output is correct
14 Correct 62 ms 94832 KB Output is correct
15 Correct 53 ms 94864 KB Output is correct
16 Correct 50 ms 94956 KB Output is correct
17 Correct 49 ms 94628 KB Output is correct
18 Correct 51 ms 94864 KB Output is correct
19 Runtime error 275 ms 248684 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -