Submission #157839

# Submission time Handle Problem Language Result Execution time Memory
157839 2019-10-13T10:43:31 Z InfiniteJest Art Exhibition (JOI18_art) C++14
50 / 100
1000 ms 21116 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(){
  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:28: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 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 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 376 KB Output is correct
# Verdict Execution time Memory 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 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 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 380 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
# Verdict Execution time Memory 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 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 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 380 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 13 ms 888 KB Output is correct
28 Correct 12 ms 860 KB Output is correct
29 Correct 12 ms 760 KB Output is correct
30 Correct 13 ms 760 KB Output is correct
31 Correct 13 ms 760 KB Output is correct
32 Correct 13 ms 888 KB Output is correct
33 Correct 12 ms 760 KB Output is correct
34 Correct 12 ms 760 KB Output is correct
35 Correct 12 ms 808 KB Output is correct
36 Correct 13 ms 952 KB Output is correct
37 Correct 12 ms 760 KB Output is correct
38 Correct 12 ms 764 KB Output is correct
39 Correct 12 ms 760 KB Output is correct
40 Correct 12 ms 760 KB Output is correct
41 Correct 12 ms 824 KB Output is correct
42 Correct 12 ms 760 KB Output is correct
43 Correct 12 ms 760 KB Output is correct
44 Correct 12 ms 760 KB Output is correct
45 Correct 12 ms 788 KB Output is correct
46 Correct 12 ms 888 KB Output is correct
47 Correct 12 ms 760 KB Output is correct
48 Correct 13 ms 760 KB Output is correct
49 Correct 12 ms 760 KB Output is correct
50 Correct 12 ms 808 KB Output is correct
51 Correct 12 ms 764 KB Output is correct
# Verdict Execution time Memory 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 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 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 380 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 380 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 13 ms 888 KB Output is correct
28 Correct 12 ms 860 KB Output is correct
29 Correct 12 ms 760 KB Output is correct
30 Correct 13 ms 760 KB Output is correct
31 Correct 13 ms 760 KB Output is correct
32 Correct 13 ms 888 KB Output is correct
33 Correct 12 ms 760 KB Output is correct
34 Correct 12 ms 760 KB Output is correct
35 Correct 12 ms 808 KB Output is correct
36 Correct 13 ms 952 KB Output is correct
37 Correct 12 ms 760 KB Output is correct
38 Correct 12 ms 764 KB Output is correct
39 Correct 12 ms 760 KB Output is correct
40 Correct 12 ms 760 KB Output is correct
41 Correct 12 ms 824 KB Output is correct
42 Correct 12 ms 760 KB Output is correct
43 Correct 12 ms 760 KB Output is correct
44 Correct 12 ms 760 KB Output is correct
45 Correct 12 ms 788 KB Output is correct
46 Correct 12 ms 888 KB Output is correct
47 Correct 12 ms 760 KB Output is correct
48 Correct 13 ms 760 KB Output is correct
49 Correct 12 ms 760 KB Output is correct
50 Correct 12 ms 808 KB Output is correct
51 Correct 12 ms 764 KB Output is correct
52 Execution timed out 1059 ms 21116 KB Time limit exceeded
53 Halted 0 ms 0 KB -