oj.uz

답안 #129154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129154 2019-07-11T18:18:05 Z miguel Art Exhibition (JOI18_art) C++14
100 / 100
 274 ms 28792 KB 
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define int ll
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, net[500004];
vector <pi> art;
int mn[500004];

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n;
    art.resize(n+1);
    for(int i=1; i<=n; i++) cin>>art[i].x>>art[i].y;
    art[0]={0, 0};
    sort(art.begin(), art.end());
    //for(int i=1; i<=n; i++) art[i].x-=art[1].x;
    //net[1]=art[1].y;

    ///cout<<endl;for(int i=1; i<=n; i++) cout<<art[i].x<<" "<<art[i].y<<endl; cout<<endl;

    for(int i=1; i<=n; i++) net[i]=art[i].y-(art[i].x-art[i-1].x);

    ///for(int i=1; i<=n; i++) cout<<net[i]<<" "; cout<<endl;
    for(int i=1; i<=n; i++) net[i]+=net[i-1];
    ///for(int i=1; i<=n; i++) cout<<net[i]<<" "; cout<<endl;
    mn[n]=net[n];
    for(int i=n-1; i>=1; i--) mn[i]=max(mn[i+1], net[i]);
    int ans=0;
    for(int i=1; i<=n; i++){
        /*if(i==6){
            dbg(mn[i]);
            dbg(net[i-1]);
            dbg(art[i].x);
        }*/
        ans=max(ans, mn[i]-net[i-1]+art[i].x-art[i-1].x);
        ///cout<<ans<<" ";
    }
    cout<<ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 372 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 372 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 5 ms 632 KB Output is correct
29 Correct 5 ms 632 KB Output is correct
30 Correct 4 ms 632 KB Output is correct
31 Correct 5 ms 632 KB Output is correct
32 Correct 4 ms 632 KB Output is correct
33 Correct 5 ms 632 KB Output is correct
34 Correct 5 ms 632 KB Output is correct
35 Correct 5 ms 632 KB Output is correct
36 Correct 4 ms 584 KB Output is correct
37 Correct 5 ms 608 KB Output is correct
38 Correct 4 ms 632 KB Output is correct
39 Correct 4 ms 632 KB Output is correct
40 Correct 4 ms 632 KB Output is correct
41 Correct 4 ms 632 KB Output is correct
42 Correct 5 ms 632 KB Output is correct
43 Correct 5 ms 632 KB Output is correct
44 Correct 4 ms 632 KB Output is correct
45 Correct 5 ms 632 KB Output is correct
46 Correct 5 ms 632 KB Output is correct
47 Correct 5 ms 632 KB Output is correct
48 Correct 4 ms 632 KB Output is correct
49 Correct 5 ms 760 KB Output is correct
50 Correct 5 ms 632 KB Output is correct
51 Correct 5 ms 632 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 352 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 372 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 4 ms 632 KB Output is correct
28 Correct 5 ms 632 KB Output is correct
29 Correct 5 ms 632 KB Output is correct
30 Correct 4 ms 632 KB Output is correct
31 Correct 5 ms 632 KB Output is correct
32 Correct 4 ms 632 KB Output is correct
33 Correct 5 ms 632 KB Output is correct
34 Correct 5 ms 632 KB Output is correct
35 Correct 5 ms 632 KB Output is correct
36 Correct 4 ms 584 KB Output is correct
37 Correct 5 ms 608 KB Output is correct
38 Correct 4 ms 632 KB Output is correct
39 Correct 4 ms 632 KB Output is correct
40 Correct 4 ms 632 KB Output is correct
41 Correct 4 ms 632 KB Output is correct
42 Correct 5 ms 632 KB Output is correct
43 Correct 5 ms 632 KB Output is correct
44 Correct 4 ms 632 KB Output is correct
45 Correct 5 ms 632 KB Output is correct
46 Correct 5 ms 632 KB Output is correct
47 Correct 5 ms 632 KB Output is correct
48 Correct 4 ms 632 KB Output is correct
49 Correct 5 ms 760 KB Output is correct
50 Correct 5 ms 632 KB Output is correct
51 Correct 5 ms 632 KB Output is correct
52 Correct 267 ms 28584 KB Output is correct
53 Correct 268 ms 28664 KB Output is correct
54 Correct 268 ms 28664 KB Output is correct
55 Correct 267 ms 28664 KB Output is correct
56 Correct 267 ms 28652 KB Output is correct
57 Correct 271 ms 28668 KB Output is correct
58 Correct 268 ms 28752 KB Output is correct
59 Correct 266 ms 28664 KB Output is correct
60 Correct 266 ms 28664 KB Output is correct
61 Correct 267 ms 28536 KB Output is correct
62 Correct 267 ms 28664 KB Output is correct
63 Correct 267 ms 28652 KB Output is correct
64 Correct 272 ms 28664 KB Output is correct
65 Correct 266 ms 28664 KB Output is correct
66 Correct 271 ms 28792 KB Output is correct
67 Correct 274 ms 28664 KB Output is correct
68 Correct 270 ms 28664 KB Output is correct