oj.uz

Submission #466483

# Submission time Handle Problem Language Result Execution time Memory
466483 2021-08-19T12:35:22 Z spike1236 Art Exhibition (JOI18_art) C++14
50 / 100
 207 ms 11972 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 5e5 + 10;
int n;
pll a[MAXN];
ll pref[MAXN];

void solve() {
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> a[i].f >> a[i].s;
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; ++i)
        pref[i] = pref[i - 1] + a[i].s;
    ll ans = a[1].s, res = -a[1].f;
    if(n <= 5000) {
        for(int i = 1; i <= n; ++i)
            for(int j = i; j <= n; ++j) ans = max(ans, pref[j] - a[j].f - (pref[i - 1] - a[i].f));
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int CNT_TESTS = 1;
    ///cin >> CNT_TESTS;
    for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
        solve();
        if(NUMCASE != CNT_TESTS) cout << '\n';
    }
    return 0;
}

Compilation message

art.cpp: In function 'void solve()':
art.cpp:35:22: warning: unused variable 'res' [-Wunused-variable]
   35 |     ll ans = a[1].s, res = -a[1].f;
      |                      ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 17 ms 452 KB Output is correct
28 Correct 17 ms 444 KB Output is correct
29 Correct 17 ms 448 KB Output is correct
30 Correct 17 ms 448 KB Output is correct
31 Correct 18 ms 452 KB Output is correct
32 Correct 17 ms 332 KB Output is correct
33 Correct 17 ms 444 KB Output is correct
34 Correct 16 ms 448 KB Output is correct
35 Correct 17 ms 448 KB Output is correct
36 Correct 17 ms 448 KB Output is correct
37 Correct 17 ms 444 KB Output is correct
38 Correct 17 ms 332 KB Output is correct
39 Correct 17 ms 448 KB Output is correct
40 Correct 17 ms 444 KB Output is correct
41 Correct 17 ms 448 KB Output is correct
42 Correct 17 ms 452 KB Output is correct
43 Correct 16 ms 332 KB Output is correct
44 Correct 17 ms 448 KB Output is correct
45 Correct 17 ms 448 KB Output is correct
46 Correct 16 ms 332 KB Output is correct
47 Correct 17 ms 332 KB Output is correct
48 Correct 17 ms 332 KB Output is correct
49 Correct 17 ms 332 KB Output is correct
50 Correct 16 ms 448 KB Output is correct
51 Correct 17 ms 444 KB Output is correct
52 Incorrect 207 ms 11972 KB Output isn't correct
53 Halted 0 ms 0 KB -