답안 #540999

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
540999	2022-03-22T06:05:35 Z	vinnipuh01	Money (IZhO17_money)	C++17	25 / 100	129 ms	308 KB

money

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long

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;

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    freopen ( "sum.in", "r", stdin )
*/

int n, a[ 1000001 ], mp[ 1000001 ];
vector <pair<int, int> > v;
set <int> vv;
int l, r;

main () {
	cin >> n;
	for ( int i = 0; i < n; i ++ )
		cin >> a[ i ];
	int bl;
	mn = oo;
	for ( int mask = 0; mask < ( 1 << n ); mask ++ ) {
		bl = ( mask & 1 );
		v.clear();
		vv.clear();
		ans = 0;
		l = 0;
		for ( int i = 0; i < n; i ++ ) {
			if ( (bool)( mask & ( 1 << i ) ) ^ (bool)bl ) {
				bl = mask & ( 1 << i );
				v.push_back( { l, i - 1 } );
				l = i;
			}
		}
		v.push_back( { l, n - 1 } );
		for ( auto i : v ) {
			for ( int j = i.first + 1; j <= i.second; j ++ ) {
				if ( a[ j ] < a[ j - 1 ] ) {
					ans = 1;
					break;
				}
			}
			if ( ans )
				break;
		}
		if ( ans )
			continue;
		for ( int j = v.front().first; j <= v.front().second; j ++ )
			vv.insert( a[ j ] );
		for ( int i = 1; i < v.size(); i ++ ) {
			auto it = vv.upper_bound( a[ v[ i ].first ] );
			if ( it != vv.end() && *it < a[ v[ i ].second ] ) {
				ans = 1;
				break;
			}
			for ( int j = v[ i ].first; j <= v[ i ].second; j ++ )
				vv.insert( a[ j ] );
		}
		if ( !ans ) {
			num = v.size();
			for ( auto i : v )
			mn = min( mn, num );
		}
	}
	cout << mn;
}

/*
6
3 6 4 5 1 2

*/

Compilation message

money.cpp:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main () {
      | ^~~~
money.cpp: In function 'int main()':
money.cpp:85:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   for ( int i = 1; i < v.size(); i ++ ) {
      |                    ~~^~~~~~~~~~
money.cpp:96:15: warning: variable 'i' set but not used [-Wunused-but-set-variable]
   96 |    for ( auto i : v )
      |               ^

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	304 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	304 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	4 ms	308 KB	Output is correct
18	Correct	2 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	119 ms	212 KB	Output is correct
21	Correct	125 ms	308 KB	Output is correct
22	Correct	129 ms	292 KB	Output is correct
23	Correct	124 ms	308 KB	Output is correct
24	Correct	116 ms	300 KB	Output is correct
25	Correct	124 ms	296 KB	Output is correct
26	Correct	116 ms	292 KB	Output is correct

Subtask #3
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	304 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	4 ms	308 KB	Output is correct
18	Correct	2 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	119 ms	212 KB	Output is correct
21	Correct	125 ms	308 KB	Output is correct
22	Correct	129 ms	292 KB	Output is correct
23	Correct	124 ms	308 KB	Output is correct
24	Correct	116 ms	300 KB	Output is correct
25	Correct	124 ms	296 KB	Output is correct
26	Correct	116 ms	292 KB	Output is correct
27	Incorrect	1 ms	212 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	308 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	308 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	304 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	4 ms	308 KB	Output is correct
18	Correct	2 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	119 ms	212 KB	Output is correct
21	Correct	125 ms	308 KB	Output is correct
22	Correct	129 ms	292 KB	Output is correct
23	Correct	124 ms	308 KB	Output is correct
24	Correct	116 ms	300 KB	Output is correct
25	Correct	124 ms	296 KB	Output is correct
26	Correct	116 ms	292 KB	Output is correct
27	Incorrect	1 ms	212 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

답안 #540999

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 20.0

Subtask #4
0 / 55.0