oj.uz

답안 #501588

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501588 2022-01-04T06:36:57 Z mansur Money (IZhO17_money) C++17
25 / 100
 360 ms 324 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e18, N = 5e5 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);  
	int n, ans = inf;
	cin >> n;
	int a[n];
	for (int i = 0; i < n; i++) cin >> a[i];
	for (int mask = 0; mask < (1 << (n - 1)); mask++) {
		vector<pii> s;
		vector<int> h;
		int l = 0, cnt = 0, is = 1;
		for (int i = 1; i < n; i++) {
			if (mask >> (i - 1) & 1) {
				s.pb({l, i - 1});
				l = i;
				cnt++;
				continue;
			}
			if (a[i] < a[i - 1]) is = 0;
		}      
		s.pb({l, n - 1});
		cnt++;
		for (auto e: s) {
			if (h.empty()) {
				for (int i = e.ff; i <= e.ss; i++) h.pb(a[i]);
				continue;
            }
            if (h[0] >= a[e.ss]) {
            	for (int i = e.ss; i >= e.ff; i--) h.insert(h.begin(), a[i]);
            	continue;
            }
            if (h.back() <= a[e.ff]) {
            	for (int i = e.ff; i <= e.ss; i++) h.pb(a[i]);
            	continue;
            }
            bool ok = 0;
			for (int i = 0; i < sz(h) - 1; i++) {
				if (h[i] <= a[e.ff] && a[e.ss] <= h[i + 1]) {
            		for (int j = e.ss; j >= e.ff; j--) h.insert(h.begin() + i + 1, a[j]);
            		ok = 1;
            		break;
				}
			}
			if (!ok) is = 0;
		}
		if (is) ans = min(ans, cnt);
	}
	cout << ans;
}

Compilation message

money.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
money.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
money.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~
money.cpp: In function 'int main()':
money.cpp:73:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |    for (int i = 0; i < sz(h) - 1; i++) {
      |                    ~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 8 ms 204 KB Output is correct
18 Correct 4 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 360 ms 288 KB Output is correct
21 Correct 311 ms 324 KB Output is correct
22 Correct 285 ms 292 KB Output is correct
23 Correct 279 ms 292 KB Output is correct
24 Correct 307 ms 292 KB Output is correct
25 Correct 296 ms 292 KB Output is correct
26 Correct 310 ms 292 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 8 ms 204 KB Output is correct
18 Correct 4 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 360 ms 288 KB Output is correct
21 Correct 311 ms 324 KB Output is correct
22 Correct 285 ms 292 KB Output is correct
23 Correct 279 ms 292 KB Output is correct
24 Correct 307 ms 292 KB Output is correct
25 Correct 296 ms 292 KB Output is correct
26 Correct 310 ms 292 KB Output is correct
27 Incorrect 1 ms 204 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 8 ms 204 KB Output is correct
18 Correct 4 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 360 ms 288 KB Output is correct
21 Correct 311 ms 324 KB Output is correct
22 Correct 285 ms 292 KB Output is correct
23 Correct 279 ms 292 KB Output is correct
24 Correct 307 ms 292 KB Output is correct
25 Correct 296 ms 292 KB Output is correct
26 Correct 310 ms 292 KB Output is correct
27 Incorrect 1 ms 204 KB Output isn't correct
28 Halted 0 ms 0 KB -