oj.uz

답안 #937250

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937250 2024-03-03T17:03:56 Z Litusiano Gym Badges (NOI22_gymbadges) C++17
9 / 100
 130 ms 17620 KB 
// #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;

bool cmp(pair<int,int> a, pair<int,int> b){
	return a.first < b.first;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n; cin>>n;
	vector<pair<int,int>> v(n); for(auto& i : v) cin>>i.first;
	for(auto& i :v) cin>>i.second;
	sort(v.begin(),v.end(),cmp);
	// for(auto x : v) cout<<x.first<<" "<<x.second<<endl;
	if(n > 5000){
		int s = 0;
		int ans = 0;
		for(int i = 0; i<n; i++){
			if(s <= v[i].second){
				s+=v[i].first; ans++;
			}
		}
		cout<<ans<<endl; return 0;
	}
	vector<vector<int>> dp(n+1, vector<int>(n+1,inf));
	dp[0][0] = 0;
	for(int i = 1; i<=n; i++){
		for(int j = 0; j<=n; j++){
			dp[i][j] = dp[i-1][j];
			// take i
			if(!j) continue;
 			int act = dp[i-1][j-1];
			if(act <= v[i-1].second) act+=v[i-1].first;
			else continue;
			dp[i][j] = min(dp[i][j],act);
			// cerr<<i<<" "<<j<<" "<<dp[i-1][j-1]<<" "<<v[i-1].second<<" "<<v[i-1].first<<"  "<<dp[i][j]<<endl;
		}
	}
	int mx = 0;
	for(int i = 0; i<=n; i++){
		// cout<<dp[n][i]<<" ";
		if(dp[n][i] != inf) mx = i;
	}
	cout<<mx<<endl;
}

Subtask #1
0 / 15.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 118 ms 8028 KB Output is correct
2 Correct 120 ms 17488 KB Output is correct
3 Correct 121 ms 17520 KB Output is correct
4 Correct 124 ms 17492 KB Output is correct
5 Correct 130 ms 17620 KB Output is correct
6 Correct 117 ms 16460 KB Output is correct
7 Correct 114 ms 15956 KB Output is correct
8 Correct 118 ms 16592 KB Output is correct
9 Correct 117 ms 16464 KB Output is correct
10 Correct 116 ms 16452 KB Output is correct
11 Correct 108 ms 15416 KB Output is correct
12 Correct 104 ms 15296 KB Output is correct
13 Correct 102 ms 15440 KB Output is correct
14 Correct 103 ms 15820 KB Output is correct
15 Correct 104 ms 15444 KB Output is correct
16 Correct 114 ms 15956 KB Output is correct
17 Correct 113 ms 15956 KB Output is correct
18 Correct 121 ms 15956 KB Output is correct
19 Correct 116 ms 16048 KB Output is correct
20 Correct 113 ms 16004 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 49.0

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