oj.uz

답안 #617220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617220 2022-08-01T09:45:40 Z erkam Lottery (CEOI18_lot) C++17
0 / 100
 74 ms 6760 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
const int N=200005,mod=1000000007;
int n,m,k,l,x,h[N];
long long dp[N],nxt[N];
vector<int>v[N];
pair<pair<int,bool>,pair<int,int> > arr[N];
int main(){
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> arr[i].nd.st >> arr[i].st.st >> arr[i].nd.nd;
		arr[i].st.nd=1;
	}
	cin >> m;
	for(int i=1;i<=m;i++){
		cin >> arr[n+i].nd.st >> arr[n+i].st.st >> arr[n+i].nd.nd;
		arr[n+i].st.nd=0;
	}
	sort(arr+1,arr+n+m+1);
	reverse(arr+1,arr+n+m+1);
	long long sum=0;
	for(int i=1;i<N;i++)dp[i]=-1e18;
	for(int i=1;i<=n+m;i++){
		if(arr[i].st.nd==1){
			sum+=arr[i].nd.st;
			for(int j=0;j<=sum;j++){
				nxt[j]=dp[j];
				if(j>=arr[i].nd.st){
					nxt[j]=max(nxt[j],dp[j-arr[i].nd.st]-arr[i].nd.nd);
				}
			}
		}
		else{
			for(int j=sum;j>=0;j--){
				nxt[j]=dp[j];
				if(j+arr[i].nd.st<=sum){
					nxt[j]=max(nxt[j],dp[j+arr[i].nd.st]+arr[i].nd.nd);
				}
			}
		}
		for(int j=0;j<=sum;j++){
			dp[j]=nxt[j];
		}
	}
	long long ans=0;
	for(int i=0;i<=sum;i++){
		ans=max(ans,dp[i]);
	}
	cout << ans << endl;
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Incorrect 5 ms 6484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Incorrect 5 ms 6484 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 74 ms 6760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 74 ms 6760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Incorrect 5 ms 6484 KB Output isn't correct
3 Halted 0 ms 0 KB -