oj.uz

답안 #497580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497580 2021-12-23T10:08:58 Z vinnipuh01 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 235788 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();
			int mxx = -1;
			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 ] );
					if ( a.v[ r ] > mxx && a.v[ r ] < mx )
						mxx = 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 ] );
				if ( a.v[ r ] > mxx && a.v[ r ] < mx )
					mxx = a.v[ r ];
				r ++;
			}
			if ( ~mxx )
				c.ans = max( c.ans, mx + mxx );
			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[ 3000001 ];
 
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:54:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |    while ( l < v.size() && r < a.v.size() ) {
      |            ~~^~~~~~~~~~
sortbooks.cpp:54:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |    while ( l < v.size() && r < a.v.size() ) {
      |                            ~~^~~~~~~~~~~~
sortbooks.cpp:66:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |    while ( l < v.size() ) {
      |            ~~^~~~~~~~~~
sortbooks.cpp:70:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |    while ( r < a.v.size() ) {
      |            ~~^~~~~~~~~~~~
sortbooks.cpp: At global scope:
sortbooks.cpp:159:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  159 | main () {
      | ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 94236 KB Output is correct
2 Correct 45 ms 94208 KB Output is correct
3 Correct 46 ms 94260 KB Output is correct
4 Correct 53 ms 94240 KB Output is correct
5 Correct 54 ms 94300 KB Output is correct
6 Correct 51 ms 94200 KB Output is correct
7 Correct 49 ms 94288 KB Output is correct
8 Correct 48 ms 94248 KB Output is correct
9 Correct 45 ms 94220 KB Output is correct
10 Correct 46 ms 94260 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 94236 KB Output is correct
2 Correct 45 ms 94208 KB Output is correct
3 Correct 46 ms 94260 KB Output is correct
4 Correct 53 ms 94240 KB Output is correct
5 Correct 54 ms 94300 KB Output is correct
6 Correct 51 ms 94200 KB Output is correct
7 Correct 49 ms 94288 KB Output is correct
8 Correct 48 ms 94248 KB Output is correct
9 Correct 45 ms 94220 KB Output is correct
10 Correct 46 ms 94260 KB Output is correct
11 Correct 47 ms 94352 KB Output is correct
12 Correct 49 ms 94864 KB Output is correct
13 Correct 55 ms 94832 KB Output is correct
14 Correct 61 ms 94876 KB Output is correct
15 Correct 51 ms 94856 KB Output is correct
16 Correct 50 ms 94944 KB Output is correct
17 Correct 49 ms 94688 KB Output is correct
18 Correct 51 ms 94840 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2914 ms 235204 KB Output is correct
2 Execution timed out 3102 ms 235788 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 235 ms 108120 KB Output is correct
2 Correct 208 ms 108068 KB Output is correct
3 Correct 221 ms 108168 KB Output is correct
4 Correct 188 ms 108040 KB Output is correct
5 Correct 176 ms 108048 KB Output is correct
6 Correct 165 ms 108124 KB Output is correct
7 Correct 168 ms 108060 KB Output is correct
8 Correct 190 ms 108112 KB Output is correct
9 Correct 78 ms 94404 KB Output is correct
10 Correct 176 ms 108156 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 94236 KB Output is correct
2 Correct 45 ms 94208 KB Output is correct
3 Correct 46 ms 94260 KB Output is correct
4 Correct 53 ms 94240 KB Output is correct
5 Correct 54 ms 94300 KB Output is correct
6 Correct 51 ms 94200 KB Output is correct
7 Correct 49 ms 94288 KB Output is correct
8 Correct 48 ms 94248 KB Output is correct
9 Correct 45 ms 94220 KB Output is correct
10 Correct 46 ms 94260 KB Output is correct
11 Correct 47 ms 94352 KB Output is correct
12 Correct 49 ms 94864 KB Output is correct
13 Correct 55 ms 94832 KB Output is correct
14 Correct 61 ms 94876 KB Output is correct
15 Correct 51 ms 94856 KB Output is correct
16 Correct 50 ms 94944 KB Output is correct
17 Correct 49 ms 94688 KB Output is correct
18 Correct 51 ms 94840 KB Output is correct
19 Correct 503 ms 123120 KB Output is correct
20 Correct 502 ms 123160 KB Output is correct
21 Correct 431 ms 123308 KB Output is correct
22 Correct 406 ms 123188 KB Output is correct
23 Correct 403 ms 123184 KB Output is correct
24 Correct 290 ms 123208 KB Output is correct
25 Correct 275 ms 123104 KB Output is correct
26 Correct 338 ms 123168 KB Output is correct
27 Correct 338 ms 123132 KB Output is correct
28 Correct 374 ms 123136 KB Output is correct
29 Correct 363 ms 123204 KB Output is correct
30 Correct 383 ms 123264 KB Output is correct
31 Correct 353 ms 123200 KB Output is correct
32 Correct 351 ms 123352 KB Output is correct
33 Correct 414 ms 123084 KB Output is correct
34 Correct 265 ms 123216 KB Output is correct
35 Correct 265 ms 123208 KB Output is correct
36 Correct 259 ms 123208 KB Output is correct
37 Correct 290 ms 123092 KB Output is correct
38 Correct 279 ms 123204 KB Output is correct
39 Correct 369 ms 123216 KB Output is correct
40 Correct 231 ms 110760 KB Output is correct
41 Correct 353 ms 123176 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 94236 KB Output is correct
2 Correct 45 ms 94208 KB Output is correct
3 Correct 46 ms 94260 KB Output is correct
4 Correct 53 ms 94240 KB Output is correct
5 Correct 54 ms 94300 KB Output is correct
6 Correct 51 ms 94200 KB Output is correct
7 Correct 49 ms 94288 KB Output is correct
8 Correct 48 ms 94248 KB Output is correct
9 Correct 45 ms 94220 KB Output is correct
10 Correct 46 ms 94260 KB Output is correct
11 Correct 47 ms 94352 KB Output is correct
12 Correct 49 ms 94864 KB Output is correct
13 Correct 55 ms 94832 KB Output is correct
14 Correct 61 ms 94876 KB Output is correct
15 Correct 51 ms 94856 KB Output is correct
16 Correct 50 ms 94944 KB Output is correct
17 Correct 49 ms 94688 KB Output is correct
18 Correct 51 ms 94840 KB Output is correct
19 Correct 2914 ms 235204 KB Output is correct
20 Execution timed out 3102 ms 235788 KB Time limit exceeded
21 Halted 0 ms 0 KB -