Submission #157840

# Submission time Handle Problem Language Result Execution time Memory
157840 2019-10-13T10:44:32 Z InfiniteJest Art Exhibition (JOI18_art) C++14
100 / 100
373 ms 26840 KB
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

ifstream in("input.txt");
ofstream out("output.txt");

typedef long long ll;

int n;
pair<ll,ll> v[500001];
ll pref[500001];
priority_queue<pair<ll,ll> > q;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin>>n;
  for(int i=0;i<n;i++)cin>>v[i].fi>>v[i].se;
  sort(v,v+n);
  ll sum=0;
  int ind=0;
  ll mas=-1;
  for(int i=0;i<n;i++){
    sum+=v[i].se;
    pref[i]=sum;
    ll solp=sum-(v[i].fi-v[0].fi);
    if(solp>mas){
      mas=solp;
      ind=i;
    }
    q.push(mp(solp,i));
  }
  for(int i=1;i<n;i++){
    /*if(v[i].fi<=v[i-1].fi+v[i-1].se){
      //mas=max(mas,pref[ind]-pref[i-1]-(v[ind].fi-v[i].fi));
      continue;
    }
    for(int y=ind;y<n;y++){
      if(y<i)continue;
      ll solp=pref[y]-pref[i-1]-(v[y].fi-v[i].fi);
      if(solp>mas){
        mas=solp;
        ind=y;
      }
    }*/
    if(q.empty())break;
    while(!q.empty()&&q.top().se<i)q.pop();
    mas=max(mas,q.top().fi+v[i].fi-v[0].fi-pref[i-1]);
    //if(!q.empty())q.pop();
  }
  cout<<mas;

}

Compilation message

art.cpp: In function 'int main()':
art.cpp:30:7: warning: variable 'ind' set but not used [-Wunused-but-set-variable]
   int ind=0;
       ^~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 292 KB Output is correct
7 Correct 2 ms 376 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 380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 292 KB Output is correct
7 Correct 2 ms 376 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 380 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 504 KB Output is correct
15 Correct 2 ms 476 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 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 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 292 KB Output is correct
7 Correct 2 ms 376 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 380 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 504 KB Output is correct
15 Correct 2 ms 476 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 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 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 5 ms 760 KB Output is correct
28 Correct 5 ms 632 KB Output is correct
29 Correct 5 ms 760 KB Output is correct
30 Correct 6 ms 636 KB Output is correct
31 Correct 5 ms 760 KB Output is correct
32 Correct 5 ms 632 KB Output is correct
33 Correct 5 ms 632 KB Output is correct
34 Correct 5 ms 760 KB Output is correct
35 Correct 5 ms 760 KB Output is correct
36 Correct 5 ms 760 KB Output is correct
37 Correct 6 ms 764 KB Output is correct
38 Correct 6 ms 760 KB Output is correct
39 Correct 5 ms 632 KB Output is correct
40 Correct 5 ms 632 KB Output is correct
41 Correct 5 ms 760 KB Output is correct
42 Correct 5 ms 632 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 5 ms 612 KB Output is correct
46 Correct 5 ms 760 KB Output is correct
47 Correct 5 ms 632 KB Output is correct
48 Correct 5 ms 760 KB Output is correct
49 Correct 5 ms 632 KB Output is correct
50 Correct 5 ms 632 KB Output is correct
51 Correct 5 ms 632 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 292 KB Output is correct
7 Correct 2 ms 376 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 380 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 504 KB Output is correct
15 Correct 2 ms 476 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 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 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 5 ms 760 KB Output is correct
28 Correct 5 ms 632 KB Output is correct
29 Correct 5 ms 760 KB Output is correct
30 Correct 6 ms 636 KB Output is correct
31 Correct 5 ms 760 KB Output is correct
32 Correct 5 ms 632 KB Output is correct
33 Correct 5 ms 632 KB Output is correct
34 Correct 5 ms 760 KB Output is correct
35 Correct 5 ms 760 KB Output is correct
36 Correct 5 ms 760 KB Output is correct
37 Correct 6 ms 764 KB Output is correct
38 Correct 6 ms 760 KB Output is correct
39 Correct 5 ms 632 KB Output is correct
40 Correct 5 ms 632 KB Output is correct
41 Correct 5 ms 760 KB Output is correct
42 Correct 5 ms 632 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 5 ms 612 KB Output is correct
46 Correct 5 ms 760 KB Output is correct
47 Correct 5 ms 632 KB Output is correct
48 Correct 5 ms 760 KB Output is correct
49 Correct 5 ms 632 KB Output is correct
50 Correct 5 ms 632 KB Output is correct
51 Correct 5 ms 632 KB Output is correct
52 Correct 325 ms 19988 KB Output is correct
53 Correct 333 ms 26816 KB Output is correct
54 Correct 332 ms 26748 KB Output is correct
55 Correct 342 ms 26724 KB Output is correct
56 Correct 373 ms 26700 KB Output is correct
57 Correct 349 ms 26580 KB Output is correct
58 Correct 314 ms 26588 KB Output is correct
59 Correct 282 ms 26704 KB Output is correct
60 Correct 320 ms 26736 KB Output is correct
61 Correct 278 ms 26840 KB Output is correct
62 Correct 276 ms 26580 KB Output is correct
63 Correct 281 ms 26708 KB Output is correct
64 Correct 287 ms 26716 KB Output is correct
65 Correct 289 ms 26628 KB Output is correct
66 Correct 287 ms 26564 KB Output is correct
67 Correct 287 ms 26560 KB Output is correct
68 Correct 286 ms 20948 KB Output is correct