답안 #971112

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
971112	2024-04-28T01:25:02 Z	Roumak77	Art Exhibition (JOI18_art)	C++17	100 / 100	154 ms	18260 KB

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <limits>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
using namespace std;

using ll = long long;
/*
void solve(){
    ll n;
    cin >> n;
    vector<pair<ll, ll>> list_n(n, pair<ll, ll>{0, 0});
    for(ll i = 0; i < n; i++){
        cin >> list_n[i].first;
        cin >> list_n[i].second;
    }


    sort(list_n.begin(), list_n.end());

    ll curr_max = -1E15 - 5;
    for(ll i = 0; i < n; i++){
        ll start = list_n[i].first;
        ll curr = 0;
        for(ll j = i; j < n; j++){
            curr += list_n[j].second;
            curr_max = max(curr_max, curr - list_n[j].first + start);
            if(curr - list_n[j].first + start == 4232545716) {
                cout << i << " " << j << endl;
            }
        }
    }
    cout << curr_max << endl;
}

*/
void solve() {
    ll n;
    cin >> n;

    ll curr_max = 0;

    vector<pair<ll, ll>> list_n(n, pair<ll, ll>{0, 0});
    for (ll i = 0; i < n; i++) {
        cin >> list_n[i].first;
        cin >> list_n[i].second;
        curr_max = max(list_n[i].second, curr_max);
    }



    sort(list_n.begin(), list_n.end());

    /*for (ll i = 0; i < n; i++) {
        cout << list_n[i].first << " " << list_n[i].second << endl;

    }*/

    ll curr_min = 0;
    ll curr = 0;
    ll curr_pos = 0;
    for(ll i = 0; i < n; i++){

        if(i == 0){
            curr = -list_n[i].first;
            curr_pos = list_n[i].second - list_n[i].first;

            curr_min = curr;

            curr_max = max(curr_max, curr_pos - curr_min);
            continue;
        }

        curr += list_n[i - 1].first + list_n[i - 1].second - list_n[i].first;
        curr_pos += list_n[i].second + list_n[i - 1].first - list_n[i].first;

        curr_min = min(curr_min, curr);
        curr_max = max(curr_max, curr_pos - curr_min);


    }


    //cout << curr_max;


    cout << curr_max << endl;

}



int main(){

    ios_base::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    ll t = 1;

    while(t--){
        solve();
    }
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	356 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 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	356 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	460 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	604 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	604 KB	Output is correct
28	Correct	2 ms	604 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	600 KB	Output is correct
31	Correct	2 ms	600 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	2 ms	604 KB	Output is correct
36	Correct	2 ms	408 KB	Output is correct
37	Correct	2 ms	852 KB	Output is correct
38	Correct	2 ms	604 KB	Output is correct
39	Correct	2 ms	604 KB	Output is correct
40	Correct	2 ms	672 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	2 ms	604 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	2 ms	604 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	2 ms	600 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	2 ms	648 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	132 ms	18004 KB	Output is correct
53	Correct	134 ms	18248 KB	Output is correct
54	Correct	135 ms	18048 KB	Output is correct
55	Correct	127 ms	18136 KB	Output is correct
56	Correct	129 ms	18256 KB	Output is correct
57	Correct	131 ms	18112 KB	Output is correct
58	Correct	126 ms	18028 KB	Output is correct
59	Correct	127 ms	18260 KB	Output is correct
60	Correct	125 ms	18260 KB	Output is correct
61	Correct	131 ms	18004 KB	Output is correct
62	Correct	125 ms	18024 KB	Output is correct
63	Correct	149 ms	18112 KB	Output is correct
64	Correct	129 ms	18160 KB	Output is correct
65	Correct	132 ms	18176 KB	Output is correct
66	Correct	126 ms	18120 KB	Output is correct
67	Correct	126 ms	18256 KB	Output is correct
68	Correct	154 ms	18240 KB	Output is correct

답안 #971112

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