oj.uz

답안 #497495

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497495 2021-12-23T07:12:22 Z vinnipuh01 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 235120 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 );
}
 
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 50 ms 94148 KB Output is correct
2 Correct 47 ms 94236 KB Output is correct
3 Correct 42 ms 94148 KB Output is correct
4 Correct 43 ms 94200 KB Output is correct
5 Correct 49 ms 94228 KB Output is correct
6 Correct 53 ms 94284 KB Output is correct
7 Correct 42 ms 94248 KB Output is correct
8 Correct 48 ms 94288 KB Output is correct
9 Correct 48 ms 94156 KB Output is correct
10 Correct 49 ms 94272 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 94148 KB Output is correct
2 Correct 47 ms 94236 KB Output is correct
3 Correct 42 ms 94148 KB Output is correct
4 Correct 43 ms 94200 KB Output is correct
5 Correct 49 ms 94228 KB Output is correct
6 Correct 53 ms 94284 KB Output is correct
7 Correct 42 ms 94248 KB Output is correct
8 Correct 48 ms 94288 KB Output is correct
9 Correct 48 ms 94156 KB Output is correct
10 Correct 49 ms 94272 KB Output is correct
11 Correct 49 ms 94300 KB Output is correct
12 Correct 47 ms 94920 KB Output is correct
13 Correct 50 ms 94824 KB Output is correct
14 Correct 52 ms 94820 KB Output is correct
15 Correct 50 ms 94916 KB Output is correct
16 Correct 56 ms 94912 KB Output is correct
17 Correct 46 ms 94640 KB Output is correct
18 Correct 45 ms 94840 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3032 ms 235120 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 108060 KB Output is correct
2 Correct 214 ms 108036 KB Output is correct
3 Correct 181 ms 108104 KB Output is correct
4 Correct 169 ms 108228 KB Output is correct
5 Correct 170 ms 108136 KB Output is correct
6 Correct 141 ms 108056 KB Output is correct
7 Correct 147 ms 108080 KB Output is correct
8 Correct 160 ms 108136 KB Output is correct
9 Correct 79 ms 94484 KB Output is correct
10 Correct 162 ms 108052 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 94148 KB Output is correct
2 Correct 47 ms 94236 KB Output is correct
3 Correct 42 ms 94148 KB Output is correct
4 Correct 43 ms 94200 KB Output is correct
5 Correct 49 ms 94228 KB Output is correct
6 Correct 53 ms 94284 KB Output is correct
7 Correct 42 ms 94248 KB Output is correct
8 Correct 48 ms 94288 KB Output is correct
9 Correct 48 ms 94156 KB Output is correct
10 Correct 49 ms 94272 KB Output is correct
11 Correct 49 ms 94300 KB Output is correct
12 Correct 47 ms 94920 KB Output is correct
13 Correct 50 ms 94824 KB Output is correct
14 Correct 52 ms 94820 KB Output is correct
15 Correct 50 ms 94916 KB Output is correct
16 Correct 56 ms 94912 KB Output is correct
17 Correct 46 ms 94640 KB Output is correct
18 Correct 45 ms 94840 KB Output is correct
19 Correct 473 ms 123156 KB Output is correct
20 Correct 486 ms 123404 KB Output is correct
21 Correct 383 ms 123148 KB Output is correct
22 Correct 390 ms 123188 KB Output is correct
23 Correct 391 ms 123092 KB Output is correct
24 Correct 280 ms 123148 KB Output is correct
25 Correct 281 ms 123184 KB Output is correct
26 Correct 329 ms 123184 KB Output is correct
27 Correct 350 ms 123564 KB Output is correct
28 Correct 337 ms 123184 KB Output is correct
29 Correct 349 ms 123292 KB Output is correct
30 Correct 347 ms 123116 KB Output is correct
31 Correct 370 ms 123136 KB Output is correct
32 Correct 368 ms 123312 KB Output is correct
33 Correct 361 ms 123088 KB Output is correct
34 Correct 262 ms 123184 KB Output is correct
35 Correct 263 ms 123184 KB Output is correct
36 Correct 276 ms 123128 KB Output is correct
37 Correct 262 ms 123200 KB Output is correct
38 Correct 265 ms 123076 KB Output is correct
39 Correct 337 ms 123228 KB Output is correct
40 Correct 226 ms 110740 KB Output is correct
41 Correct 347 ms 123308 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 94148 KB Output is correct
2 Correct 47 ms 94236 KB Output is correct
3 Correct 42 ms 94148 KB Output is correct
4 Correct 43 ms 94200 KB Output is correct
5 Correct 49 ms 94228 KB Output is correct
6 Correct 53 ms 94284 KB Output is correct
7 Correct 42 ms 94248 KB Output is correct
8 Correct 48 ms 94288 KB Output is correct
9 Correct 48 ms 94156 KB Output is correct
10 Correct 49 ms 94272 KB Output is correct
11 Correct 49 ms 94300 KB Output is correct
12 Correct 47 ms 94920 KB Output is correct
13 Correct 50 ms 94824 KB Output is correct
14 Correct 52 ms 94820 KB Output is correct
15 Correct 50 ms 94916 KB Output is correct
16 Correct 56 ms 94912 KB Output is correct
17 Correct 46 ms 94640 KB Output is correct
18 Correct 45 ms 94840 KB Output is correct
19 Execution timed out 3032 ms 235120 KB Time limit exceeded
20 Halted 0 ms 0 KB -