oj.uz

Submission #793654

# Submission time Handle Problem Language Result Execution time Memory
793654 2023-07-26T05:08:43 Z mindiyak Art Exhibition (JOI18_art) C++14
100 / 100
 166 ms 28768 KB 
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (ll i = 0; i < (a); i++)
#define FORd(i, a, b) for (ll i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (ll i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fst first
#define nl endl
#define sec second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
const int MX = INT_MAX;
const int MN = INT_MIN;
void init()
{
#ifndef ONLINE_JUDGE
	freopen("input.in", "r", stdin);
	freopen("output.out", "w", stdout);
#endif
}
void fastIO()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void solve()
{
	ll n;cin>>n;
	vpl arr(n);
	FOR(i,0,n)cin >> arr[i].first >> arr[i].second;//size,value

	sort(all(arr));

	ll ans = 0;
	vpl dp(n,{0,0});//sum,min size
	dp[0] = {arr[0].second,arr[0].first};
	FOR(i,1,n){
		dp[i] = {arr[i].second,arr[i].first};
		ans = max(ans,dp[i].first);
		ll sum = dp[i-1].first + arr[i].second;
		ll possible = sum - arr[i].first + dp[i-1].second;
		if(dp[i].first < possible){
			dp[i] = {sum,dp[i-1].second};
		}
		ans = max(ans,possible);
	}

	// FOR(i,0,n){
	// 	cout << i << " " << dp[i].first << " " << dp[i].second << endl;
	// }

	cout << ans << endl;
}


int main()
{
	fastIO();
	// init();
	int t = 1;
	// cin >> t;
	while (t--)
		solve();
	return 0;
}

Compilation message

art.cpp: In function 'void init()':
art.cpp:40:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |  freopen("input.in", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:41:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  freopen("output.out", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 0 ms 328 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 0 ms 328 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 524 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 3 ms 584 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 2 ms 584 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 588 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 584 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 584 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 2 ms 584 KB Output is correct
47 Correct 2 ms 584 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 2 ms 588 KB Output is correct
51 Correct 2 ms 528 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 0 ms 328 KB Output is correct
27 Correct 2 ms 588 KB Output is correct
28 Correct 2 ms 524 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 3 ms 584 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 2 ms 584 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 2 ms 588 KB Output is correct
40 Correct 2 ms 596 KB Output is correct
41 Correct 2 ms 584 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 584 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 2 ms 588 KB Output is correct
46 Correct 2 ms 584 KB Output is correct
47 Correct 2 ms 584 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 2 ms 588 KB Output is correct
51 Correct 2 ms 528 KB Output is correct
52 Correct 136 ms 28484 KB Output is correct
53 Correct 143 ms 28600 KB Output is correct
54 Correct 166 ms 28624 KB Output is correct
55 Correct 133 ms 28604 KB Output is correct
56 Correct 148 ms 28612 KB Output is correct
57 Correct 132 ms 28612 KB Output is correct
58 Correct 133 ms 28596 KB Output is correct
59 Correct 145 ms 28768 KB Output is correct
60 Correct 142 ms 28624 KB Output is correct
61 Correct 137 ms 28492 KB Output is correct
62 Correct 131 ms 28612 KB Output is correct
63 Correct 140 ms 28628 KB Output is correct
64 Correct 133 ms 28628 KB Output is correct
65 Correct 137 ms 28628 KB Output is correct
66 Correct 136 ms 28636 KB Output is correct
67 Correct 135 ms 28620 KB Output is correct
68 Correct 153 ms 28616 KB Output is correct