oj.uz

Submission #109901

# Submission time Handle Problem Language Result Execution time Memory
109901 2019-05-08T11:09:38 Z cgiosy Watching (JOI13_watching) C++17
100 / 100
 259 ms 16476 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(i,x,n) for(int i=x; i<=n; i++)

int a[2048], d[2048][2048], n, x, y;
int main() {
	scanf("%d%d%d", &n, &x, &y);
	if(n<y) y=n; if(n-y<x) x=n-y;
	rep(i, 1, n) scanf("%d", a+i);
	std::sort(a+1, a+n+1);

	int l=1, r=a[n]-a[1]+1;
	while(l<r) {
		int m=(l+r)/2, p=0, q=0;
		rep(i, 0, n) {
			while(p<=i && a[p]<=a[i]-m) p++;
			while(p<=i && a[q]<=a[i]-2*m) q++;
			rep(j, !i, x) d[i][j]=i ? j ? std::min(d[p-1][j-1], d[q-1][j]+1) : d[q-1][j]+1 : 0;
		}
		if(d[n][x]<=y) r=m;
		else l=m+1;
	}
	printf("%d", r);
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:9:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(n<y) y=n; if(n-y<x) x=n-y;
  ^~
watching.cpp:9:15: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(n<y) y=n; if(n-y<x) x=n-y;
               ^~
watching.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &x, &y);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
watching.cpp:10:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  rep(i, 1, n) scanf("%d", a+i);
               ~~~~~^~~~~~~~~~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 3 ms 768 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8320 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 91 ms 16400 KB Output is correct
4 Correct 259 ms 16384 KB Output is correct
5 Correct 9 ms 8320 KB Output is correct
6 Correct 11 ms 8320 KB Output is correct
7 Correct 11 ms 8320 KB Output is correct
8 Correct 29 ms 8320 KB Output is correct
9 Correct 114 ms 16392 KB Output is correct
10 Correct 215 ms 16300 KB Output is correct
11 Correct 23 ms 8320 KB Output is correct
12 Correct 164 ms 16476 KB Output is correct
13 Correct 12 ms 8448 KB Output is correct
14 Correct 14 ms 8448 KB Output is correct
15 Correct 13 ms 8448 KB Output is correct