oj.uz

답안 #34574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
34574 2017-11-13T05:31:10 Z sinhriv 구경하기 (JOI13_watching) C++14
50 / 100
 1000 ms 20964 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 2202;
 
int n, p, q;
int a[N];
int f[N][N];
 
int main(){
	if(fopen("1.inp", "r")){
		freopen("1.inp", "r", stdin);
	}
 
	scanf("%d%d%d", &n, &p, &q);
 
	for(int i = 1; i <= n; ++i){
		scanf("%d", a + i);
	}
 
	p = min(p, n);
	q = min(q, n);
 
	sort(a + 1, a + n + 1);
 
	int low = 1, high = 1e9, ans = 1e9;
 
	while(low <= high){
		int w = (low + high) >> 1;
	
		memset(f, 60, sizeof f);
		f[0][0] = 0;
 
		bool ok = false, debug = false;
 
			
		for(int j = 0; j <= p; ++j){
 
			int pterOne = 0, pterTwo = 0;

			for(int i = 1; i <= n; ++i){

				while(a[i] - a[pterOne + 1] + 1 > w) ++pterOne;
				while(a[i] - a[pterTwo + 1] + 1 > w + w) ++pterTwo;
				
				if(j > 0 && pterOne < i) f[i][j] = min(f[i][j], f[pterOne][j - 1]);
				if(pterTwo < i) f[i][j] = min(f[i][j], f[pterTwo][j] + 1);
				
 
				if(i == n && f[i][j] <= q){
					ok = true;
				}
			}
		}
 
 
		if(ok == false){
			low = w + 1;
		}
		else{
			ans = w;
			high = w - 1;
		}
	}
 
	cout << ans;
 
	return 0;
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:35:20: warning: unused variable 'debug' [-Wunused-variable]
   bool ok = false, debug = false;
                    ^
watching.cpp:13:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen("1.inp", "r", stdin);
                               ^
watching.cpp:16:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &p, &q);
                             ^
watching.cpp:19:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + i);
                     ^

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 20964 KB Output is correct
2 Correct 76 ms 20964 KB Output is correct
3 Correct 36 ms 20964 KB Output is correct
4 Correct 43 ms 20964 KB Output is correct
5 Correct 36 ms 20964 KB Output is correct
6 Correct 36 ms 20964 KB Output is correct
7 Correct 36 ms 20964 KB Output is correct
8 Correct 39 ms 20964 KB Output is correct
9 Correct 46 ms 20964 KB Output is correct
10 Correct 43 ms 20964 KB Output is correct
11 Correct 46 ms 20964 KB Output is correct
12 Correct 39 ms 20964 KB Output is correct
13 Correct 39 ms 20964 KB Output is correct
14 Correct 39 ms 20964 KB Output is correct
15 Correct 46 ms 20964 KB Output is correct

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 20964 KB Output is correct
2 Correct 36 ms 20964 KB Output is correct
3 Execution timed out 1000 ms 20964 KB Execution timed out
4 Halted 0 ms 0 KB -