oj.uz

Submission #466488

# Submission time Handle Problem Language Result Execution time Memory
466488 2021-08-19T12:44:57 Z mariowong Watching (JOI13_watching) C++14
0 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
using namespace std;
 
int l,r,mid,n,p,q,a[2005],dp[2005][2005];
vector <int> v;
deque <int> dq; 
map <int,bool> m;
int main(){
	scanf("%d%d%d",&n,&p,&q);
	for (int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	sort(a+1,a+1+n);
	l=0; r=n;
	while (l < r){
		mid=(l+r)/2;
		for (int i=0;i<=min(n,q);i++){ //used how many large
			for (int j=1;j<=n;j++){
				dp[i][j]=1e9;
			}
		}
		for (int i=0;i<=min(n,q);i++){ //used how many large
			if (i > 0){
				dq.push_back(0);
				for (int j=1;j<=n;j++){
				/*	while (!dq.empty() && a[j]-a[dq.front()+1]+1 > 2*v[mid]) dq.pop_front();
					if (dq.empty()){
						l=mid+1;
						while (!dq.empty()) dq.pop_front();
						goto out;
					}
					else
					dp[i][j]=dp[i-1][dq.front()];
					while (!dq.empty() && dp[i-1][j] <= dp[i-1][dq.back()]) dq.pop_back();
					dq.push_back(j);*/
				}
				while (!dq.empty()) dq.pop_back();
			}
			dq.push_back(0);
			for (int j=1;j<=n;j++){
		/* 		while (!dq.empty() && a[j]-a[dq.front()+1]+1 > v[mid]) dq.pop_front();
				if (!dq.empty())
				dp[i][j]=min(dp[i][j],dp[i][dq.front()]+1);
				while (!dq.empty() && dp[i][j] <= dp[i][dq.back()]) dq.pop_back();
				dq.push_back(j);*/
			}
			while (!dq.empty()) dq.pop_back();
		}
		if (dp[min(n,q)][n] <= p)
		r=mid;
		else
		l=mid+1;
		out:;
	}
	printf("%d\n",v[l]);
	return 0;
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:53:3: warning: label 'out' defined but not used [-Wunused-label]
   53 |   out:;
      |   ^~~
watching.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |  scanf("%d%d%d",&n,&p,&q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
watching.cpp:11:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |   scanf("%d",&a[i]);
      |   ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -