답안 #169160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169160	2019-12-18T18:18:25 Z	tselmegkh	Money (IZhO17_money)	C++14	45 / 100	1500 ms	3276 KB

money

#include<bits/stdc++.h>
using namespace std;

inline vector<int> mergesort(vector<int> a, vector<int> b){
	int i = 0, j = 0;
	vector<int> res;
	while(i < a.size() && j < b.size()){
		if(a[i] < b[j]){
			res.push_back(a[i]);
			i++;
		}else{
			res.push_back(b[j]);
			j++;
		}
	}
	while(i < a.size()){
		res.push_back(a[i]);
		i++;
	}
	while(j < b.size()){
		res.push_back(b[j]);
		j++;
	}
	return res;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n;
	cin >> n;
	vector<int> a(n);

	int ans = 1;
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	int j = 1;
	vector<int> b;
	b.push_back(a[0]);
	while(a[j] >= a[j - 1] && j < n){
		b.push_back(a[j]);
		j++;
	}
	int cnt = 0, bound = 0;
	vector<int> cursegment;
	while(j < n){
		int l = 0, r = b.size() - 1;
		if(cnt == 0){
			ans++;
			while(l != r){
				int mid = (l + r + 1) / 2;
				if(b[mid] <= a[j]){
					l = mid;
				}else{
					r = mid - 1;
				}
			}
			if(b[l] > a[j]){
				l = -1;
			}
			int sz = b.size() - 1;
			if(l < sz){
				bound = b[l + 1];
			}else{
				bound = 1e9;
			}
			cnt++;
			cursegment.push_back(a[j]);
			j++;
		}else{
			if(a[j] < a[j - 1]){
				cnt = 0;
				b = mergesort(b, cursegment);
				cursegment.clear();
				continue;
			}else{
				if(a[j] <= bound){
					cursegment.push_back(a[j]);
					cnt++;
					j++;
				}else{
					cnt = 0;
					b = mergesort(b, cursegment);
					cursegment.clear();
				}
			}
		}	
	}
	cout << ans << '\n';
}

Compilation message

money.cpp: In function 'std::vector<int> mergesort(std::vector<int>, std::vector<int>)':
money.cpp:7:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i < a.size() && j < b.size()){
        ~~^~~~~~~~~~
money.cpp:7:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i < a.size() && j < b.size()){
                        ~~^~~~~~~~~~
money.cpp:16:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i < a.size()){
        ~~^~~~~~~~~~
money.cpp:20:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(j < b.size()){
        ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	424 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	424 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	424 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct
35	Correct	2 ms	376 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	376 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Execution timed out	1581 ms	3276 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

답안 #169160

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0