oj.uz

Submission #1108394

# Submission time Handle Problem Language Result Execution time Memory
1108394 2024-11-04T04:04:44 Z vjudge1 Art Exhibition (JOI18_art) C++17
50 / 100
 1000 ms 11988 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define pa pair<ll, ll>
#define fi first
#define se second
#define bit(mask, j) (mask & (1<<j))
const ll mod = 1e9 + 7;
const ll INF = 1e17;
const ll N = 5e5 + 10;
pa a[N];
ll s[N], ans = 0;
int main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    #define NAME "hbmt"
        if(fopen(NAME".inp", "r")) {
            freopen(NAME".inp", "r", stdin);
            freopen(NAME".out", "w", stdout);
        }
    ll n;
    cin >> n;
    FOR(i, 1, n)
    {
        cin >> a[i].fi >> a[i].se;
    }
    sort(a + 1, a + n + 1);
    FOR(i, 1, n)
    {
        s[i] = s[i - 1] + a[i].se;
    }
    FOR(i, 1, n)
    {
        ll res = 0;
        FORD(j, i, 1)
        {
            res += a[j].se;
            ans = max(ans, res - (a[i].fi - a[j].fi));
        }
    }
    // FOR(i, 1, n)
    // {
    //     ll res = s[i] - a[i].fi + a[1].fi;
    //     ll res2 = s[n] - s[i - 1] - a[n].fi + a[i].fi;
    //     ans = max({ans, res, res2});
    // }
    cout << ans;
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:21:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |             freopen(NAME".inp", "r", stdin);
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:22:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |             freopen(NAME".out", "w", stdout);
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2552 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 1 ms 2384 KB Output is correct
17 Correct 1 ms 2384 KB Output is correct
18 Correct 1 ms 2384 KB Output is correct
19 Correct 1 ms 2384 KB Output is correct
20 Correct 1 ms 2384 KB Output is correct
21 Correct 1 ms 2384 KB Output is correct
22 Correct 1 ms 2384 KB Output is correct
23 Correct 1 ms 2384 KB Output is correct
24 Correct 1 ms 2384 KB Output is correct
25 Correct 1 ms 2384 KB Output is correct
26 Correct 1 ms 2384 KB Output is correct
27 Correct 12 ms 2384 KB Output is correct
28 Correct 11 ms 2384 KB Output is correct
29 Correct 11 ms 2384 KB Output is correct
30 Correct 12 ms 2384 KB Output is correct
31 Correct 11 ms 2560 KB Output is correct
32 Correct 11 ms 2384 KB Output is correct
33 Correct 11 ms 2384 KB Output is correct
34 Correct 12 ms 2384 KB Output is correct
35 Correct 11 ms 2556 KB Output is correct
36 Correct 12 ms 2384 KB Output is correct
37 Correct 11 ms 2516 KB Output is correct
38 Correct 13 ms 2384 KB Output is correct
39 Correct 12 ms 2384 KB Output is correct
40 Correct 12 ms 2384 KB Output is correct
41 Correct 11 ms 2560 KB Output is correct
42 Correct 11 ms 2384 KB Output is correct
43 Correct 12 ms 2388 KB Output is correct
44 Correct 12 ms 2560 KB Output is correct
45 Correct 12 ms 2384 KB Output is correct
46 Correct 12 ms 2384 KB Output is correct
47 Correct 12 ms 2384 KB Output is correct
48 Correct 11 ms 2384 KB Output is correct
49 Correct 12 ms 2384 KB Output is correct
50 Correct 15 ms 2384 KB Output is correct
51 Correct 11 ms 2384 KB Output is correct
52 Execution timed out 1075 ms 11988 KB Time limit exceeded
53 Halted 0 ms 0 KB -