oj.uz

Submission #528578

# Submission time Handle Problem Language Result Execution time Memory
528578 2022-02-20T16:23:03 Z CSQ31 Akcija (COCI21_akcija) C++17
0 / 110
 5000 ms 63180 KB 
#pragma GCC optimize("Ofast") 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
int n,k;
vector<PII>ans;
PII v[2001],dp[2001][2001];
PII s(int i,int j){
	if(dp[i][j].fi != -1)return dp[i][j];
	dp[i][j] = s(i+1,j);
	if(v[i].fi > j){
		PII res = s(i+1,j+1);
		res.fi++;
		res.se+=v[i].se;
		dp[i][j] = max(dp[i][j],res);
	}
	return dp[i][j];
}
void search(int i,int j,ll cnt,ll val){
	if(sz(ans) == k)return;
	if(i==n){
		if(PII(cnt,val) < PII(0,0))ans.pb({cnt,val});
		return;	
	}
	if(s(i,j) < PII(cnt,val))return;
	search(i+1,j,cnt,val);
	if(v[i].fi > j)search(i+1,j+1,cnt-1,val-v[i].se);
}
int main()
{
	cin>>n>>k;
	for(int i=0;i<n;i++){
		cin>>v[i].se>>v[i].fi;
		v[i].se = 1e9-v[i].se;
	}
	sort(v,v+n);
	//for(int i=0;i<n;i++)cout<<v[i].fi<<" "<<v[i].se<<'\n';
	for(int i=0;i<n;i++)
		for(int j=0;j<=n;j++)dp[i][j] = {-1,-1};
	ll mxv = n * 1LL * 1e9 + 1;
	ll l=1,r=n*mxv;
	while(r>=l){
		ll mid = (l+r)/2;
		ll cnt = mid/mxv,val = mid%mxv;
		ans.clear();
		search(0,0,cnt,val);
		//cout<<cnt<<" "<<val<<" "<<sz(ans)<<'\n';
		if(sz(ans) >= k)l=mid+1;
		else r=mid-1;
	}
	ll cnt = l/mxv,val = l%mxv;
	ans.clear();
	search(0,0,cnt,val);
	while(sz(ans)<k)ans.pb({0,0});
	sort(all(ans));
	for(PII &x:ans){
		x.fi = -x.fi + cnt;
		x.se = x.fi * 1e9 + x.se - val;
	}
	for(auto x:ans)cout<<x.fi<<" "<<x.se<<'\n';
	
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5046 ms 60620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5046 ms 60620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 60620 KB Output is correct
2 Correct 75 ms 63180 KB Output is correct
3 Correct 51 ms 57992 KB Output is correct
4 Correct 53 ms 57292 KB Output is correct
5 Correct 59 ms 62540 KB Output is correct
6 Correct 25 ms 57208 KB Output is correct
7 Correct 29 ms 62804 KB Output is correct
8 Correct 24 ms 58260 KB Output is correct
9 Correct 25 ms 56944 KB Output is correct
10 Correct 31 ms 59156 KB Output is correct
11 Incorrect 0 ms 204 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Incorrect 1 ms 332 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 844 KB Output is correct
2 Correct 3 ms 844 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 3 ms 844 KB Output is correct
6 Incorrect 3 ms 716 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5046 ms 60620 KB Time limit exceeded
2 Halted 0 ms 0 KB -