oj.uz

Submission #12770

# Submission time Handle Problem Language Result Execution time Memory
12770 2015-01-03T11:53:16 Z Qwaz 격자 보존하기 (GA9_preserve) C++14
17 / 100
 28 ms 2372 KB 
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int MAX = 100020;

int n, d, k, data[MAX];

void input(){
	scanf("%d%d%d", &n, &k, &d);

	for(int i = 0; i < k; i++)
		scanf("%d", &data[i]);
}

vector < int > gap;

int res;

void solve(){
	int front = data[0]-1, rear = n-data[k-1];

	for(int i = 1; i < k; i++)
		gap.push_back(data[i]-data[i-1]-1);

	sort(gap.begin(), gap.end());

	int index = k-1, current = 0;
	while(index >= 0 && d > 0){
		if(index < k-1){
			d -= 2;
			current += gap[index];
		}
		index--;

		if(d >= 1){
			res = max(res, current+front);
			res = max(res, current+rear);
		}

		if(d >= 2)
			res = max(res, current+front+rear);
	}

	printf("%d\n", res);
}

int main(){
	input();

	solve();

	return 0;
}

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1600 KB Output is correct
2 Correct 0 ms 1600 KB Output is correct
3 Correct 0 ms 1600 KB Output is correct
4 Correct 0 ms 1600 KB Output is correct
5 Correct 0 ms 1600 KB Output is correct
6 Correct 0 ms 1600 KB Output is correct
7 Correct 0 ms 1600 KB Output is correct
8 Correct 0 ms 1600 KB Output is correct
9 Correct 0 ms 1600 KB Output is correct
10 Incorrect 0 ms 1600 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1600 KB Output is correct
2 Correct 0 ms 1600 KB Output is correct
3 Correct 0 ms 1600 KB Output is correct
4 Correct 0 ms 1600 KB Output is correct
5 Correct 0 ms 1600 KB Output is correct
6 Correct 0 ms 1600 KB Output is correct
7 Correct 0 ms 1600 KB Output is correct
8 Correct 0 ms 1600 KB Output is correct
9 Correct 0 ms 1600 KB Output is correct
10 Correct 0 ms 1600 KB Output is correct
11 Correct 0 ms 1600 KB Output is correct
12 Correct 0 ms 1600 KB Output is correct
13 Correct 0 ms 1600 KB Output is correct
14 Correct 0 ms 1600 KB Output is correct
15 Correct 0 ms 1600 KB Output is correct
16 Correct 0 ms 1600 KB Output is correct
17 Correct 0 ms 1600 KB Output is correct
18 Correct 0 ms 1600 KB Output is correct
19 Correct 0 ms 1600 KB Output is correct
20 Correct 0 ms 1600 KB Output is correct
21 Correct 0 ms 1600 KB Output is correct
22 Correct 0 ms 1600 KB Output is correct
23 Correct 0 ms 1600 KB Output is correct

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 2372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2372 KB Output is correct
2 Correct 20 ms 2372 KB Output is correct
3 Correct 24 ms 2372 KB Output is correct
4 Correct 28 ms 2372 KB Output is correct
5 Incorrect 20 ms 2372 KB Output isn't correct
6 Halted 0 ms 0 KB -