oj.uz

Submission #216762

# Submission time Handle Problem Language Result Execution time Memory
216762 2020-03-28T03:30:54 Z tushar_2658 Art Exhibition (JOI18_art) C++14
50 / 100
 1000 ms 24696 KB 
#include "bits/stdc++.h"
using namespace std;

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

pair<ll, ll> p[maxn];

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++){
    for(int j = 1; j < i; j++){
      ans = max(ans, (pref[i] - pref[j - 1]) - p[i].first + p[j].first);
    }
    ans = max(ans, pref[i] - pref[i - 1]);
  }
  cout << ans << endl;

  return 0;
}

Compilation message

art.cpp: In function 'int main(int, const char**)':
art.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
art.cpp:15: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);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 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 4 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 256 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 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 4 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 256 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 7 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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 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 4 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 256 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 7 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 21 ms 512 KB Output is correct
28 Correct 21 ms 512 KB Output is correct
29 Correct 21 ms 512 KB Output is correct
30 Correct 21 ms 512 KB Output is correct
31 Correct 21 ms 640 KB Output is correct
32 Correct 21 ms 512 KB Output is correct
33 Correct 21 ms 512 KB Output is correct
34 Correct 21 ms 512 KB Output is correct
35 Correct 21 ms 512 KB Output is correct
36 Correct 21 ms 640 KB Output is correct
37 Correct 21 ms 512 KB Output is correct
38 Correct 21 ms 512 KB Output is correct
39 Correct 21 ms 512 KB Output is correct
40 Correct 21 ms 640 KB Output is correct
41 Correct 22 ms 512 KB Output is correct
42 Correct 26 ms 760 KB Output is correct
43 Correct 21 ms 560 KB Output is correct
44 Correct 22 ms 512 KB Output is correct
45 Correct 21 ms 512 KB Output is correct
46 Correct 21 ms 512 KB Output is correct
47 Correct 30 ms 512 KB Output is correct
48 Correct 23 ms 512 KB Output is correct
49 Correct 22 ms 640 KB Output is correct
50 Correct 22 ms 640 KB Output is correct
51 Correct 21 ms 640 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 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 4 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 256 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 7 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 21 ms 512 KB Output is correct
28 Correct 21 ms 512 KB Output is correct
29 Correct 21 ms 512 KB Output is correct
30 Correct 21 ms 512 KB Output is correct
31 Correct 21 ms 640 KB Output is correct
32 Correct 21 ms 512 KB Output is correct
33 Correct 21 ms 512 KB Output is correct
34 Correct 21 ms 512 KB Output is correct
35 Correct 21 ms 512 KB Output is correct
36 Correct 21 ms 640 KB Output is correct
37 Correct 21 ms 512 KB Output is correct
38 Correct 21 ms 512 KB Output is correct
39 Correct 21 ms 512 KB Output is correct
40 Correct 21 ms 640 KB Output is correct
41 Correct 22 ms 512 KB Output is correct
42 Correct 26 ms 760 KB Output is correct
43 Correct 21 ms 560 KB Output is correct
44 Correct 22 ms 512 KB Output is correct
45 Correct 21 ms 512 KB Output is correct
46 Correct 21 ms 512 KB Output is correct
47 Correct 30 ms 512 KB Output is correct
48 Correct 23 ms 512 KB Output is correct
49 Correct 22 ms 640 KB Output is correct
50 Correct 22 ms 640 KB Output is correct
51 Correct 21 ms 640 KB Output is correct
52 Execution timed out 1096 ms 24696 KB Time limit exceeded
53 Halted 0 ms 0 KB -