답안 #886468

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
886468	2023-12-12T08:00:41 Z	vjudge1	Gym Badges (NOI22_gymbadges)	C++17	9 / 100	157 ms	21328 KB

Main

#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second 
#define N 500005
#define int long long

const int INF = 1e9 + 7;

int x[N], l[N];

int32_t main(){
	//fileio();
	fastio();


	int n;
	cin>>n;
	for (int i = 1; i <= n; i++){
		cin>>x[i];
	}
	for (int i = 1; i <= n; i++){
		cin>>l[i];
	}

	vector<int> v(n, 0);
	iota(v.begin(), v.end(), 1);
	sort(v.begin(), v.end(), [&](int a, int b){
		if (x[a] == x[b]) return l[a] < l[b];
		return x[a] < x[b];
	});

	int maks = 0, sum = 0;
	int ans = 0;
	for (auto i : v){
		//cout<<i<<sp;
		if (sum <= l[i] || sum + x[i] <= maks){
			sum += x[i];
			ans++;
			maks = max(maks, l[i] + x[i]);
		}
	}
	//cout<<endl;
	cout<<ans<<endl;
	cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

Subtask #1

0 / 15.0

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

Subtask #2

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	127 ms	12116 KB	Output is correct
2	Correct	125 ms	21052 KB	Output is correct
3	Correct	125 ms	21328 KB	Output is correct
4	Correct	124 ms	20948 KB	Output is correct
5	Correct	157 ms	21172 KB	Output is correct
6	Correct	121 ms	20276 KB	Output is correct
7	Correct	122 ms	19636 KB	Output is correct
8	Correct	139 ms	20284 KB	Output is correct
9	Correct	124 ms	20284 KB	Output is correct
10	Correct	126 ms	20308 KB	Output is correct
11	Correct	118 ms	19576 KB	Output is correct
12	Correct	116 ms	19280 KB	Output is correct
13	Correct	113 ms	19244 KB	Output is correct
14	Correct	114 ms	19284 KB	Output is correct
15	Correct	110 ms	19244 KB	Output is correct
16	Correct	122 ms	19792 KB	Output is correct
17	Correct	118 ms	20056 KB	Output is correct
18	Correct	123 ms	19948 KB	Output is correct
19	Correct	117 ms	19796 KB	Output is correct
20	Correct	123 ms	19796 KB	Output is correct

Subtask #3

0 / 27.0

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

Subtask #4

0 / 49.0

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