oj.uz

Submission #72992

# Submission time Handle Problem Language Result Execution time Memory
72992 2018-08-27T12:21:38 Z garyye Art Exhibition (JOI18_art) C++14
100 / 100
 357 ms 8652 KB 
// author: gary
// created: 2018/08/27 14:14:01
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <limits>
#include <utility>
#include <functional>
#include <string>
#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>
#include <iostream>
#include <sstream>
using namespace std;
#define SZ(x) ( (int) (x).size() )
#define ALL(c) (c).begin(), (c).end()
#define CNT(c, x) ((c).find(x) != (c).end())
typedef long long ll;
typedef pair<ll, int> pii;
template<class T> bool cmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool cmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }


const int N = 5e5 + 10;

int n;
pii p[N];

int main() {
  scanf("%d", &n);
  for(int i = 0; i < n; i++) {
    scanf("%lld%d", &p[i].first, &p[i].second);
  }
  sort(p, p + n);

  ll ans = -(1LL << 62);
  ll best = -(1LL << 62);

  ll sum = 0;
  for(int i = 0; i < n; i++) {
    ll nsum = sum + p[i].second;

    cmax(best, -sum + p[i].first);
    cmax(ans, nsum - p[i].first + best);

    sum = nsum;
  }

  printf("%lld\n", ans);
  return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
art.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%d", &p[i].first, &p[i].second);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 552 KB Output is correct
8 Correct 2 ms 624 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 2 ms 744 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 552 KB Output is correct
8 Correct 2 ms 624 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 2 ms 744 KB Output is correct
12 Correct 2 ms 744 KB Output is correct
13 Correct 2 ms 744 KB Output is correct
14 Correct 2 ms 744 KB Output is correct
15 Correct 2 ms 744 KB Output is correct
16 Correct 2 ms 744 KB Output is correct
17 Correct 3 ms 744 KB Output is correct
18 Correct 4 ms 744 KB Output is correct
19 Correct 2 ms 744 KB Output is correct
20 Correct 2 ms 744 KB Output is correct
21 Correct 3 ms 744 KB Output is correct
22 Correct 2 ms 744 KB Output is correct
23 Correct 2 ms 744 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 3 ms 744 KB Output is correct
26 Correct 2 ms 744 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 552 KB Output is correct
8 Correct 2 ms 624 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 2 ms 744 KB Output is correct
12 Correct 2 ms 744 KB Output is correct
13 Correct 2 ms 744 KB Output is correct
14 Correct 2 ms 744 KB Output is correct
15 Correct 2 ms 744 KB Output is correct
16 Correct 2 ms 744 KB Output is correct
17 Correct 3 ms 744 KB Output is correct
18 Correct 4 ms 744 KB Output is correct
19 Correct 2 ms 744 KB Output is correct
20 Correct 2 ms 744 KB Output is correct
21 Correct 3 ms 744 KB Output is correct
22 Correct 2 ms 744 KB Output is correct
23 Correct 2 ms 744 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 3 ms 744 KB Output is correct
26 Correct 2 ms 744 KB Output is correct
27 Correct 5 ms 744 KB Output is correct
28 Correct 6 ms 744 KB Output is correct
29 Correct 4 ms 744 KB Output is correct
30 Correct 5 ms 744 KB Output is correct
31 Correct 6 ms 744 KB Output is correct
32 Correct 5 ms 744 KB Output is correct
33 Correct 5 ms 744 KB Output is correct
34 Correct 5 ms 744 KB Output is correct
35 Correct 6 ms 744 KB Output is correct
36 Correct 4 ms 744 KB Output is correct
37 Correct 5 ms 744 KB Output is correct
38 Correct 5 ms 744 KB Output is correct
39 Correct 5 ms 744 KB Output is correct
40 Correct 7 ms 744 KB Output is correct
41 Correct 6 ms 744 KB Output is correct
42 Correct 5 ms 744 KB Output is correct
43 Correct 7 ms 744 KB Output is correct
44 Correct 7 ms 744 KB Output is correct
45 Correct 6 ms 792 KB Output is correct
46 Correct 5 ms 792 KB Output is correct
47 Correct 5 ms 796 KB Output is correct
48 Correct 6 ms 796 KB Output is correct
49 Correct 5 ms 796 KB Output is correct
50 Correct 6 ms 796 KB Output is correct
51 Correct 5 ms 796 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 552 KB Output is correct
8 Correct 2 ms 624 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 2 ms 744 KB Output is correct
12 Correct 2 ms 744 KB Output is correct
13 Correct 2 ms 744 KB Output is correct
14 Correct 2 ms 744 KB Output is correct
15 Correct 2 ms 744 KB Output is correct
16 Correct 2 ms 744 KB Output is correct
17 Correct 3 ms 744 KB Output is correct
18 Correct 4 ms 744 KB Output is correct
19 Correct 2 ms 744 KB Output is correct
20 Correct 2 ms 744 KB Output is correct
21 Correct 3 ms 744 KB Output is correct
22 Correct 2 ms 744 KB Output is correct
23 Correct 2 ms 744 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 3 ms 744 KB Output is correct
26 Correct 2 ms 744 KB Output is correct
27 Correct 5 ms 744 KB Output is correct
28 Correct 6 ms 744 KB Output is correct
29 Correct 4 ms 744 KB Output is correct
30 Correct 5 ms 744 KB Output is correct
31 Correct 6 ms 744 KB Output is correct
32 Correct 5 ms 744 KB Output is correct
33 Correct 5 ms 744 KB Output is correct
34 Correct 5 ms 744 KB Output is correct
35 Correct 6 ms 744 KB Output is correct
36 Correct 4 ms 744 KB Output is correct
37 Correct 5 ms 744 KB Output is correct
38 Correct 5 ms 744 KB Output is correct
39 Correct 5 ms 744 KB Output is correct
40 Correct 7 ms 744 KB Output is correct
41 Correct 6 ms 744 KB Output is correct
42 Correct 5 ms 744 KB Output is correct
43 Correct 7 ms 744 KB Output is correct
44 Correct 7 ms 744 KB Output is correct
45 Correct 6 ms 792 KB Output is correct
46 Correct 5 ms 792 KB Output is correct
47 Correct 5 ms 796 KB Output is correct
48 Correct 6 ms 796 KB Output is correct
49 Correct 5 ms 796 KB Output is correct
50 Correct 6 ms 796 KB Output is correct
51 Correct 5 ms 796 KB Output is correct
52 Correct 300 ms 8476 KB Output is correct
53 Correct 297 ms 8476 KB Output is correct
54 Correct 297 ms 8476 KB Output is correct
55 Correct 301 ms 8476 KB Output is correct
56 Correct 280 ms 8604 KB Output is correct
57 Correct 357 ms 8604 KB Output is correct
58 Correct 290 ms 8604 KB Output is correct
59 Correct 290 ms 8604 KB Output is correct
60 Correct 297 ms 8604 KB Output is correct
61 Correct 302 ms 8604 KB Output is correct
62 Correct 291 ms 8604 KB Output is correct
63 Correct 302 ms 8604 KB Output is correct
64 Correct 341 ms 8652 KB Output is correct
65 Correct 289 ms 8652 KB Output is correct
66 Correct 284 ms 8652 KB Output is correct
67 Correct 282 ms 8652 KB Output is correct
68 Correct 275 ms 8652 KB Output is correct