Submission #216919

# Submission time Handle Problem Language Result Execution time Memory
216919 2020-03-28T12:38:39 Z tushar_2658 Art Exhibition (JOI18_art) C++14
100 / 100
454 ms 33144 KB
#include "bits/stdc++.h"
using namespace std;

const int maxn = 500005;
using ll = long long;

pair<ll, ll> p[maxn];
ll t[maxn << 2]; 

void upd(int node, int b, int e, int i, ll val){
  if(i > e || i < b)return;
  if(b == i && i == e){
    t[node] = val;
    return;
  }
  int mid = (b + e) >> 1;
  upd(2*node, b, mid, i, val);
  upd(2*node + 1, mid + 1, e, i, val);
  t[node] = max(t[2*node], t[2*node + 1]);
}

ll query(int node, int b, int e, int i, int j){
  if(i > j)return 0;
  if(i > e || j < b)return 0; 
  if(b >= i && j >= e)return t[node];
  int mid = (b + e) >> 1;
  return max(query(2*node, b, mid, i, j), query(2*node + 1, mid + 1, e, i, j));
}

int main(int argc, char const *argv[])
{
//  freopen("in.txt", "r", stdin);
  int n;
  scanf("%d", &n);
  for(int i = 1; i <= n; i++){
    scanf("%lld %lld", &p[i].first, &p[i].second);
  }
  sort(p + 1, p + n + 1);
  vector<ll> pref(n + 1);
  for(int i = 1; i <= n; i++){
    pref[i] = pref[i - 1] + p[i].second;
  }
  ll ans = -1e18;
  for(int i = 1; i <= n; i++){
    upd(1, 1, n, i, p[i].first - pref[i - 1]);
  }
  for(int i = 1; i <= n; i++){
    ans = max(ans, pref[i] - p[i].first + query(1, 1, n, 1, i));
  }
  cout << ans << endl;

  return 0;
}

Compilation message

art.cpp: In function 'int main(int, const char**)':
art.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
art.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &p[i].first, &p[i].second);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 8 ms 768 KB Output is correct
28 Correct 8 ms 640 KB Output is correct
29 Correct 8 ms 640 KB Output is correct
30 Correct 8 ms 640 KB Output is correct
31 Correct 8 ms 640 KB Output is correct
32 Correct 8 ms 768 KB Output is correct
33 Correct 8 ms 640 KB Output is correct
34 Correct 8 ms 640 KB Output is correct
35 Correct 8 ms 640 KB Output is correct
36 Correct 9 ms 768 KB Output is correct
37 Correct 8 ms 768 KB Output is correct
38 Correct 8 ms 640 KB Output is correct
39 Correct 9 ms 768 KB Output is correct
40 Correct 8 ms 640 KB Output is correct
41 Correct 8 ms 640 KB Output is correct
42 Correct 8 ms 640 KB Output is correct
43 Correct 8 ms 640 KB Output is correct
44 Correct 8 ms 640 KB Output is correct
45 Correct 9 ms 768 KB Output is correct
46 Correct 11 ms 640 KB Output is correct
47 Correct 10 ms 640 KB Output is correct
48 Correct 8 ms 640 KB Output is correct
49 Correct 8 ms 768 KB Output is correct
50 Correct 8 ms 640 KB Output is correct
51 Correct 8 ms 640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 8 ms 768 KB Output is correct
28 Correct 8 ms 640 KB Output is correct
29 Correct 8 ms 640 KB Output is correct
30 Correct 8 ms 640 KB Output is correct
31 Correct 8 ms 640 KB Output is correct
32 Correct 8 ms 768 KB Output is correct
33 Correct 8 ms 640 KB Output is correct
34 Correct 8 ms 640 KB Output is correct
35 Correct 8 ms 640 KB Output is correct
36 Correct 9 ms 768 KB Output is correct
37 Correct 8 ms 768 KB Output is correct
38 Correct 8 ms 640 KB Output is correct
39 Correct 9 ms 768 KB Output is correct
40 Correct 8 ms 640 KB Output is correct
41 Correct 8 ms 640 KB Output is correct
42 Correct 8 ms 640 KB Output is correct
43 Correct 8 ms 640 KB Output is correct
44 Correct 8 ms 640 KB Output is correct
45 Correct 9 ms 768 KB Output is correct
46 Correct 11 ms 640 KB Output is correct
47 Correct 10 ms 640 KB Output is correct
48 Correct 8 ms 640 KB Output is correct
49 Correct 8 ms 768 KB Output is correct
50 Correct 8 ms 640 KB Output is correct
51 Correct 8 ms 640 KB Output is correct
52 Correct 433 ms 28536 KB Output is correct
53 Correct 419 ms 32888 KB Output is correct
54 Correct 436 ms 33016 KB Output is correct
55 Correct 439 ms 32888 KB Output is correct
56 Correct 432 ms 33144 KB Output is correct
57 Correct 427 ms 32888 KB Output is correct
58 Correct 436 ms 33016 KB Output is correct
59 Correct 423 ms 32888 KB Output is correct
60 Correct 447 ms 33016 KB Output is correct
61 Correct 425 ms 32760 KB Output is correct
62 Correct 454 ms 33096 KB Output is correct
63 Correct 431 ms 32888 KB Output is correct
64 Correct 432 ms 32864 KB Output is correct
65 Correct 447 ms 33016 KB Output is correct
66 Correct 431 ms 32888 KB Output is correct
67 Correct 442 ms 33016 KB Output is correct
68 Correct 413 ms 32888 KB Output is correct