oj.uz

답안 #34575

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
34575 2017-11-13T05:33:31 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;
	
		for(int i = 0; i <= n; ++i){
			for(int j = 0; j <= n; ++j){
				f[i][j] = 1e9;
			}
		}
		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;
					break;
				}
			}
			if(ok) break;
		}
 
 
		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:39: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 0 ms 20964 KB Output is correct
2 Correct 0 ms 20964 KB Output is correct
3 Correct 0 ms 20964 KB Output is correct
4 Correct 0 ms 20964 KB Output is correct
5 Correct 0 ms 20964 KB Output is correct
6 Correct 0 ms 20964 KB Output is correct
7 Correct 0 ms 20964 KB Output is correct
8 Correct 0 ms 20964 KB Output is correct
9 Correct 0 ms 20964 KB Output is correct
10 Correct 0 ms 20964 KB Output is correct
11 Correct 0 ms 20964 KB Output is correct
12 Correct 0 ms 20964 KB Output is correct
13 Correct 0 ms 20964 KB Output is correct
14 Correct 0 ms 20964 KB Output is correct
15 Correct 0 ms 20964 KB Output is correct

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 20964 KB Output is correct
2 Correct 0 ms 20964 KB Output is correct
3 Correct 199 ms 20964 KB Output is correct
4 Correct 963 ms 20964 KB Output is correct
5 Correct 89 ms 20964 KB Output is correct
6 Correct 103 ms 20964 KB Output is correct
7 Correct 109 ms 20964 KB Output is correct
8 Correct 163 ms 20964 KB Output is correct
9 Correct 593 ms 20964 KB Output is correct
10 Execution timed out 1000 ms 20964 KB Execution timed out
11 Halted 0 ms 0 KB -