oj.uz

답안 #1064542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064542 2024-08-18T14:14:04 Z beaconmc Tricks of the Trade (CEOI23_trade) C++14
10 / 100
 8000 ms 171860 KB 
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;



int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	ll n,k;
	cin >> n >> k;
	vector<ll> price(n), sell(n);
	FOR(i,0,n) cin >> price[i];
	FOR(i,0,n) cin >> sell[i];
	ll ans = -1000000000000000;
	FOR(i,0,n){
		set<array<ll,2>> stuff;
		ll sum = 0;
		ll cost = 0;
		FOR(j,i,n){
			cost += price[j];
			sum += sell[j];

			stuff.insert({sell[j], j});
			if (stuff.size() > k){
				auto it = stuff.begin();
				sum -= (*it)[0];
				stuff.erase(it);
			}

			if (stuff.size()==k) ans = max(ans, sum-cost);
		}
	}

	cout << ans << "\n";

	vector<ll> used(n);
	vector<vector<ll>> idk(n+1);

	FOR(i,0,n){
		
		set<array<ll,2>> stuff;
		
		ll sum = 0;
		ll cost = 0;
		FOR(j,i,n){
			cost += price[j];
			sum += sell[j];

			stuff.insert({sell[j], j});

			if (stuff.size() > k){
				auto it = stuff.begin();
				sum -= (*it)[0];
				stuff.erase(it);
			}

			if (stuff.size()==k && (sum-cost) == ans){
				idk[i].push_back((*stuff.begin())[0]);
				idk[j+1].push_back(-(*stuff.begin())[0]);
			}
		}
	}

	multiset<ll> now;
	FOR(i,0,n){
		for (auto&k : idk[i]){
			if (k>0) now.insert(k);
			else now.erase(now.find(-k));
		}
		if (sell[i] >= (*now.begin())) used[i] = 1;

	}
	for (auto&i : used) cout << i;







}

Compilation message

trade.cpp: In function 'int main()':
trade.cpp:30:21: warning: comparison of integer expressions of different signedness: 'std::set<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   30 |    if (stuff.size() > k){
      |        ~~~~~~~~~~~~~^~~
trade.cpp:36:20: warning: comparison of integer expressions of different signedness: 'std::set<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   36 |    if (stuff.size()==k) ans = max(ans, sum-cost);
      |        ~~~~~~~~~~~~^~~
trade.cpp:57:21: warning: comparison of integer expressions of different signedness: 'std::set<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   57 |    if (stuff.size() > k){
      |        ~~~~~~~~~~~~~^~~
trade.cpp:63:20: warning: comparison of integer expressions of different signedness: 'std::set<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   63 |    if (stuff.size()==k && (sum-cost) == ans){
      |        ~~~~~~~~~~~~^~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 352 KB Partially correct
2 Correct 1 ms 348 KB Output is correct

Subtask #1
5.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Partially correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Partially correct
4 Partially correct 4 ms 348 KB Partially correct
5 Partially correct 5 ms 344 KB Partially correct
6 Partially correct 1 ms 348 KB Partially correct
7 Partially correct 3 ms 348 KB Partially correct
8 Correct 3 ms 532 KB Output is correct
9 Partially correct 3 ms 348 KB Partially correct
10 Partially correct 3 ms 348 KB Partially correct
11 Partially correct 3 ms 348 KB Partially correct

Subtask #2
5.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Partially correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 348 KB Partially correct
4 Partially correct 4 ms 348 KB Partially correct
5 Partially correct 5 ms 344 KB Partially correct
6 Partially correct 1 ms 348 KB Partially correct
7 Partially correct 3 ms 348 KB Partially correct
8 Correct 3 ms 532 KB Output is correct
9 Partially correct 3 ms 348 KB Partially correct
10 Partially correct 3 ms 348 KB Partially correct
11 Partially correct 3 ms 348 KB Partially correct
12 Partially correct 0 ms 348 KB Partially correct
13 Correct 0 ms 348 KB Output is correct
14 Partially correct 1 ms 348 KB Partially correct
15 Partially correct 4 ms 348 KB Partially correct
16 Partially correct 4 ms 352 KB Partially correct
17 Partially correct 2 ms 356 KB Partially correct
18 Partially correct 4 ms 456 KB Partially correct
19 Correct 4 ms 600 KB Output is correct
20 Partially correct 3 ms 348 KB Partially correct
21 Partially correct 3 ms 352 KB Partially correct
22 Partially correct 3 ms 356 KB Partially correct
23 Partially correct 4742 ms 1104 KB Partially correct
24 Partially correct 1008 ms 708 KB Partially correct
25 Partially correct 3142 ms 864 KB Partially correct
26 Partially correct 2343 ms 848 KB Partially correct
27 Correct 3903 ms 171860 KB Output is correct
28 Partially correct 905 ms 592 KB Partially correct
29 Partially correct 4418 ms 980 KB Partially correct

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 8087 ms 4188 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 8087 ms 4188 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 352 KB Partially correct
2 Correct 1 ms 348 KB Output is correct
3 Partially correct 1 ms 344 KB Partially correct
4 Correct 0 ms 348 KB Output is correct
5 Partially correct 0 ms 348 KB Partially correct
6 Partially correct 4 ms 348 KB Partially correct
7 Partially correct 5 ms 344 KB Partially correct
8 Partially correct 1 ms 348 KB Partially correct
9 Partially correct 3 ms 348 KB Partially correct
10 Correct 3 ms 532 KB Output is correct
11 Partially correct 3 ms 348 KB Partially correct
12 Partially correct 3 ms 348 KB Partially correct
13 Partially correct 3 ms 348 KB Partially correct
14 Partially correct 0 ms 348 KB Partially correct
15 Correct 0 ms 348 KB Output is correct
16 Partially correct 1 ms 348 KB Partially correct
17 Partially correct 4 ms 348 KB Partially correct
18 Partially correct 4 ms 352 KB Partially correct
19 Partially correct 2 ms 356 KB Partially correct
20 Partially correct 4 ms 456 KB Partially correct
21 Correct 4 ms 600 KB Output is correct
22 Partially correct 3 ms 348 KB Partially correct
23 Partially correct 3 ms 352 KB Partially correct
24 Partially correct 3 ms 356 KB Partially correct
25 Partially correct 4742 ms 1104 KB Partially correct
26 Partially correct 1008 ms 708 KB Partially correct
27 Partially correct 3142 ms 864 KB Partially correct
28 Partially correct 2343 ms 848 KB Partially correct
29 Correct 3903 ms 171860 KB Output is correct
30 Partially correct 905 ms 592 KB Partially correct
31 Partially correct 4418 ms 980 KB Partially correct
32 Correct 0 ms 348 KB Output is correct
33 Execution timed out 8087 ms 4188 KB Time limit exceeded
34 Halted 0 ms 0 KB -