oj.uz

Submission #1107840

# Submission time Handle Problem Language Result Execution time Memory
1107840 2024-11-02T07:28:44 Z vjudge1 Art Exhibition (JOI18_art) C++17
100 / 100
 138 ms 29252 KB 
#include <bits/stdc++.h>
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
using namespace std;
const int N=5e5+5;
const int inf=1e18;
const int mod=1e9+7;
const int N1=1e5+25;
vector<pair<int,int> >v;
vector<int>v1;
int dp[N];
int dp1[N];
struct edge{
    int v,time;
};
signed main(){
 //  freopen("input.txt", "r", stdin);
  // freopen("output.txt","w",stdout);
    boost;
    int n;
    cin>>n;
    v.push_back({0,0});
    int ans=0;
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        v.push_back({x,y});
    }
    sort(v.begin(),v.end());
    int cnt=0;
    for(int i=1;i<=n;i++){
        cnt+=v[i].second;
        dp[i]=cnt-v[i].first;
            dp1[i]=dp1[i-1]+v[i].second;
    }
    cnt=0;
    int pos=1;
    ans=0;
    for(int i=1;i<=n;i++){
            if(cnt<v[i].first-dp1[i-1]){
            cnt=v[i].first-dp1[i-1];
        }
        ans=max(ans,dp[i]+cnt);
    }
    cout<<ans;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:38:9: warning: unused variable 'pos' [-Wunused-variable]
   38 |     int pos=1;
      |         ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2488 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2552 KB Output is correct
16 Correct 1 ms 2480 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2540 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 2 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 1 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2488 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2552 KB Output is correct
16 Correct 1 ms 2480 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2540 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 2 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 1 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct
27 Correct 2 ms 2896 KB Output is correct
28 Correct 2 ms 2896 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2896 KB Output is correct
31 Correct 2 ms 2848 KB Output is correct
32 Correct 2 ms 2896 KB Output is correct
33 Correct 2 ms 2896 KB Output is correct
34 Correct 2 ms 2896 KB Output is correct
35 Correct 2 ms 3064 KB Output is correct
36 Correct 2 ms 2896 KB Output is correct
37 Correct 2 ms 2896 KB Output is correct
38 Correct 2 ms 2912 KB Output is correct
39 Correct 2 ms 2816 KB Output is correct
40 Correct 2 ms 2896 KB Output is correct
41 Correct 2 ms 2816 KB Output is correct
42 Correct 2 ms 2896 KB Output is correct
43 Correct 2 ms 2768 KB Output is correct
44 Correct 2 ms 2856 KB Output is correct
45 Correct 2 ms 2816 KB Output is correct
46 Correct 2 ms 2640 KB Output is correct
47 Correct 2 ms 2896 KB Output is correct
48 Correct 2 ms 2896 KB Output is correct
49 Correct 2 ms 2896 KB Output is correct
50 Correct 2 ms 2896 KB Output is correct
51 Correct 2 ms 2784 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2488 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2552 KB Output is correct
16 Correct 1 ms 2480 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2540 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 2 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 1 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct
27 Correct 2 ms 2896 KB Output is correct
28 Correct 2 ms 2896 KB Output is correct
29 Correct 2 ms 2668 KB Output is correct
30 Correct 2 ms 2896 KB Output is correct
31 Correct 2 ms 2848 KB Output is correct
32 Correct 2 ms 2896 KB Output is correct
33 Correct 2 ms 2896 KB Output is correct
34 Correct 2 ms 2896 KB Output is correct
35 Correct 2 ms 3064 KB Output is correct
36 Correct 2 ms 2896 KB Output is correct
37 Correct 2 ms 2896 KB Output is correct
38 Correct 2 ms 2912 KB Output is correct
39 Correct 2 ms 2816 KB Output is correct
40 Correct 2 ms 2896 KB Output is correct
41 Correct 2 ms 2816 KB Output is correct
42 Correct 2 ms 2896 KB Output is correct
43 Correct 2 ms 2768 KB Output is correct
44 Correct 2 ms 2856 KB Output is correct
45 Correct 2 ms 2816 KB Output is correct
46 Correct 2 ms 2640 KB Output is correct
47 Correct 2 ms 2896 KB Output is correct
48 Correct 2 ms 2896 KB Output is correct
49 Correct 2 ms 2896 KB Output is correct
50 Correct 2 ms 2896 KB Output is correct
51 Correct 2 ms 2784 KB Output is correct
52 Correct 128 ms 28844 KB Output is correct
53 Correct 119 ms 29252 KB Output is correct
54 Correct 137 ms 29072 KB Output is correct
55 Correct 131 ms 28852 KB Output is correct
56 Correct 123 ms 29104 KB Output is correct
57 Correct 119 ms 28080 KB Output is correct
58 Correct 120 ms 29104 KB Output is correct
59 Correct 129 ms 29080 KB Output is correct
60 Correct 138 ms 29104 KB Output is correct
61 Correct 128 ms 29104 KB Output is correct
62 Correct 124 ms 27932 KB Output is correct
63 Correct 129 ms 29116 KB Output is correct
64 Correct 124 ms 29240 KB Output is correct
65 Correct 127 ms 26804 KB Output is correct
66 Correct 128 ms 29112 KB Output is correct
67 Correct 125 ms 29112 KB Output is correct
68 Correct 124 ms 28848 KB Output is correct