oj.uz

Submission #714826

# Submission time Handle Problem Language Result Execution time Memory
714826 2023-03-25T10:10:12 Z epicci23 Art Exhibition (JOI18_art) C++17
100 / 100
 738 ms 50536 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in();
  
  map<int,int> mp;

  for(int i=1;i<=n;i++)
  {
    int a=in(),b=in();
    mp[a]+=b;
  }

  vector<pii> ar;
  for(auto x:mp) ar.pb(x);

  vector<pii> suf(sz(ar));
  int cur=0;
  for(int i=sz(ar)-1;i>=0;i--)
  {
    cur+=ar[i].ss;
    suf[i]={ar[i].ff,cur};
  }

  int ans=-INF;
  int maxi=-INF;

  for(int i=0;i<sz(ar);i++)
  {
    maxi=max(maxi,suf[i].ff+suf[i].ss);
    int curi=maxi-suf[i].ff;
    if(i+1<sz(suf)) curi-=suf[i+1].ss;
    ans=max(ans,curi);
  }

  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

art.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 3 ms 960 KB Output is correct
28 Correct 4 ms 900 KB Output is correct
29 Correct 4 ms 900 KB Output is correct
30 Correct 3 ms 964 KB Output is correct
31 Correct 3 ms 968 KB Output is correct
32 Correct 4 ms 976 KB Output is correct
33 Correct 4 ms 900 KB Output is correct
34 Correct 3 ms 968 KB Output is correct
35 Correct 5 ms 980 KB Output is correct
36 Correct 3 ms 900 KB Output is correct
37 Correct 5 ms 900 KB Output is correct
38 Correct 5 ms 980 KB Output is correct
39 Correct 5 ms 980 KB Output is correct
40 Correct 5 ms 956 KB Output is correct
41 Correct 4 ms 968 KB Output is correct
42 Correct 3 ms 980 KB Output is correct
43 Correct 4 ms 976 KB Output is correct
44 Correct 5 ms 900 KB Output is correct
45 Correct 3 ms 900 KB Output is correct
46 Correct 5 ms 972 KB Output is correct
47 Correct 3 ms 964 KB Output is correct
48 Correct 3 ms 980 KB Output is correct
49 Correct 4 ms 976 KB Output is correct
50 Correct 3 ms 980 KB Output is correct
51 Correct 5 ms 980 KB Output is correct
52 Correct 648 ms 50408 KB Output is correct
53 Correct 673 ms 50352 KB Output is correct
54 Correct 738 ms 50436 KB Output is correct
55 Correct 640 ms 50432 KB Output is correct
56 Correct 671 ms 50356 KB Output is correct
57 Correct 635 ms 50472 KB Output is correct
58 Correct 651 ms 50524 KB Output is correct
59 Correct 643 ms 50456 KB Output is correct
60 Correct 651 ms 50352 KB Output is correct
61 Correct 596 ms 50536 KB Output is correct
62 Correct 644 ms 50432 KB Output is correct
63 Correct 650 ms 50412 KB Output is correct
64 Correct 669 ms 50412 KB Output is correct
65 Correct 590 ms 50348 KB Output is correct
66 Correct 649 ms 50464 KB Output is correct
67 Correct 643 ms 50344 KB Output is correct
68 Correct 603 ms 50364 KB Output is correct