oj.uz

답안 #760255

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760255 2023-06-17T10:56:04 Z OrazB Money (IZhO17_money) C++14
25 / 100
 1500 ms 2764 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int n, mn, a[N], c[N];
vector<int> E[N];

void bit(int x){
	if (x == n){
		for (int i = 0; i <= n; i++) E[i].clear();
		int idx = 0;
		for (int i = 1; i <= n; i++){
			E[idx].pb(a[i]);
			if (c[i]) idx++;
		}
		vector<int> vec;
		for (int i = 0; i <= idx; i++){
			int ind = vec.size()-1;
			while(ind >= 0 and vec[ind] > E[i][0]) ind--;
			ind++;
			for (int j = 0; j < (int)E[i].size(); j++){
				vec.insert(vec.begin()+ind+j, E[i][j]);
			}
		}
		for (int i = 1; i < n; i++){
			if (vec[i] < vec[i-1]) return;
		}
		mn = min(mn, idx+1);
		return;
	}
	for (int i = 0; i < 2; i++){
		c[x] = i;
		bit(x+1);
	}
}

int chk(){
	mn = 1e9;
	bit(1);
	return mn;
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
	}
	cout << chk();
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2672 KB Output is correct
3 Correct 1 ms 2676 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2672 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2672 KB Output is correct
9 Correct 1 ms 2676 KB Output is correct
10 Correct 2 ms 2672 KB Output is correct
11 Correct 1 ms 2676 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2676 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 6 ms 2644 KB Output is correct
18 Correct 4 ms 2672 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 160 ms 2660 KB Output is correct
21 Correct 165 ms 2664 KB Output is correct
22 Correct 150 ms 2676 KB Output is correct
23 Correct 150 ms 2644 KB Output is correct
24 Correct 164 ms 2660 KB Output is correct
25 Correct 183 ms 2644 KB Output is correct
26 Correct 179 ms 2764 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2672 KB Output is correct
3 Correct 1 ms 2676 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2672 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2672 KB Output is correct
9 Correct 1 ms 2676 KB Output is correct
10 Correct 2 ms 2672 KB Output is correct
11 Correct 1 ms 2676 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2676 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 6 ms 2644 KB Output is correct
18 Correct 4 ms 2672 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 160 ms 2660 KB Output is correct
21 Correct 165 ms 2664 KB Output is correct
22 Correct 150 ms 2676 KB Output is correct
23 Correct 150 ms 2644 KB Output is correct
24 Correct 164 ms 2660 KB Output is correct
25 Correct 183 ms 2644 KB Output is correct
26 Correct 179 ms 2764 KB Output is correct
27 Execution timed out 1590 ms 2644 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2672 KB Output is correct
3 Correct 1 ms 2676 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2672 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2672 KB Output is correct
9 Correct 1 ms 2676 KB Output is correct
10 Correct 2 ms 2672 KB Output is correct
11 Correct 1 ms 2676 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2676 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 6 ms 2644 KB Output is correct
18 Correct 4 ms 2672 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 160 ms 2660 KB Output is correct
21 Correct 165 ms 2664 KB Output is correct
22 Correct 150 ms 2676 KB Output is correct
23 Correct 150 ms 2644 KB Output is correct
24 Correct 164 ms 2660 KB Output is correct
25 Correct 183 ms 2644 KB Output is correct
26 Correct 179 ms 2764 KB Output is correct
27 Execution timed out 1590 ms 2644 KB Time limit exceeded
28 Halted 0 ms 0 KB -