답안 #1094130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094130	2024-09-28T15:01:11 Z	Lakshya108	Art Exhibition (JOI18_art)	C++14	100 / 100	132 ms	28756 KB

// https://oj.uz/problem/view/JOI18_stove
// OI\JOI18\JOI18-art.pdf

#include <bits/stdc++.h>
using namespace std;

// Macros
#define pb          push_back
#define pf          push_front
#define ff          first
#define ss          second
#define all(v)      v.begin(), v.end()
#define rall(v)     v.rbegin(), v.rend()

// #define rep(i, x, n)   for(int i = x; i < n; ++i)
// #define rrep(i, x, n)  for(int i = x; i >= n; --i)

// Read and Print
#define read(a, n) for(ll i = 0; i < n; ++i) cin >> a[i];
#define print(a, n) for(ll i = 0; i < n; ++i){ cout << a[i] << " ";} cout << "\n";
#define endl "\n"
#define sp " "

// Typedefs
typedef long long ll;
typedef long double ld;
typedef pair <ll, ll> pii;
typedef vector <ll> vi;
typedef vector <vector <ll>> vvi;
using vec = vector<int>;

// Constants
const ll mxn = 1e6 + 5;
const ll mod = 1e9 + 7;

// Solve

void solve() {
    int n;  cin>>n;
    vector<pii> a(n+1);
    for(int i = 0; i<n; i++){
        cin>>a[i].ff>>a[i].ss;
    }    
    sort(all(a));
    ll ans = 0;
    vi sum(n+1, 0), mx(n+1, 0);
    // sum[0]=0;
    // mx[0]=0;
    for(int i = 1; i<=n; i++){
        sum[i]=sum[i-1]+a[i].ss;
        mx[i]=max(mx[i-1], a[i].ff-sum[i-1]);
        ans = max(ans, sum[i]-a[i].ff+mx[i]);
    }
    cout<<ans<<endl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();

    return 0;
}

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	352 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	352 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	352 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	0 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	Correct	0 ms	352 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	352 KB	Output is correct
12	Correct	1 ms	352 KB	Output is correct
13	Correct	0 ms	352 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	352 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	460 KB	Output is correct
22	Correct	1 ms	352 KB	Output is correct
23	Correct	1 ms	352 KB	Output is correct
24	Correct	0 ms	356 KB	Output is correct
25	Correct	0 ms	352 KB	Output is correct
26	Correct	0 ms	608 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	0 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	Correct	0 ms	352 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	352 KB	Output is correct
12	Correct	1 ms	352 KB	Output is correct
13	Correct	0 ms	352 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	352 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	460 KB	Output is correct
22	Correct	1 ms	352 KB	Output is correct
23	Correct	1 ms	352 KB	Output is correct
24	Correct	0 ms	356 KB	Output is correct
25	Correct	0 ms	352 KB	Output is correct
26	Correct	0 ms	608 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	2 ms	616 KB	Output is correct
29	Correct	2 ms	736 KB	Output is correct
30	Correct	1 ms	612 KB	Output is correct
31	Correct	1 ms	736 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	656 KB	Output is correct
34	Correct	2 ms	616 KB	Output is correct
35	Correct	2 ms	612 KB	Output is correct
36	Correct	1 ms	600 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	1 ms	608 KB	Output is correct
40	Correct	1 ms	608 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	724 KB	Output is correct
43	Correct	1 ms	604 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	720 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	0 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	Correct	0 ms	352 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	352 KB	Output is correct
12	Correct	1 ms	352 KB	Output is correct
13	Correct	0 ms	352 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	352 KB	Output is correct
19	Correct	0 ms	352 KB	Output is correct
20	Correct	0 ms	352 KB	Output is correct
21	Correct	0 ms	460 KB	Output is correct
22	Correct	1 ms	352 KB	Output is correct
23	Correct	1 ms	352 KB	Output is correct
24	Correct	0 ms	356 KB	Output is correct
25	Correct	0 ms	352 KB	Output is correct
26	Correct	0 ms	608 KB	Output is correct
27	Correct	2 ms	856 KB	Output is correct
28	Correct	2 ms	616 KB	Output is correct
29	Correct	2 ms	736 KB	Output is correct
30	Correct	1 ms	612 KB	Output is correct
31	Correct	1 ms	736 KB	Output is correct
32	Correct	1 ms	604 KB	Output is correct
33	Correct	1 ms	656 KB	Output is correct
34	Correct	2 ms	616 KB	Output is correct
35	Correct	2 ms	612 KB	Output is correct
36	Correct	1 ms	600 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	1 ms	608 KB	Output is correct
40	Correct	1 ms	608 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	724 KB	Output is correct
43	Correct	1 ms	604 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	720 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	600 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	130 ms	28632 KB	Output is correct
53	Correct	130 ms	28756 KB	Output is correct
54	Correct	132 ms	28644 KB	Output is correct
55	Correct	130 ms	28752 KB	Output is correct
56	Correct	124 ms	28752 KB	Output is correct
57	Correct	125 ms	28632 KB	Output is correct
58	Correct	125 ms	28756 KB	Output is correct
59	Correct	124 ms	28752 KB	Output is correct
60	Correct	124 ms	28752 KB	Output is correct
61	Correct	119 ms	28500 KB	Output is correct
62	Correct	122 ms	28756 KB	Output is correct
63	Correct	124 ms	28752 KB	Output is correct
64	Correct	120 ms	28748 KB	Output is correct
65	Correct	123 ms	28756 KB	Output is correct
66	Correct	128 ms	28628 KB	Output is correct
67	Correct	122 ms	28752 KB	Output is correct
68	Correct	122 ms	28752 KB	Output is correct

답안 #1094130

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0