oj.uz

Submission #1115351

# Submission time Handle Problem Language Result Execution time Memory
1115351 2024-11-20T11:10:21 Z staszic_ojuz Art Exhibition (JOI18_art) C++17
50 / 100
 1000 ms 23624 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <stack>
#include <unordered_map>

using namespace std;

typedef long long ll;

struct dzielo {
    ll s;
    ll v;
};

struct triple {
    ll a;
    ll b;
    ll c;
};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n; cin >> n;
    vector<dzielo> arts(n);
    for(int i = 0; i < n; i++) {
        ll s, v; cin >> s >> v;
        arts[i].s = s; arts[i].v = v;
    }
    sort(arts.begin(), arts.end(), [](dzielo a, dzielo b) {return a.s < b.s;});

    vector<ll> sp(n + 1);
    for(int i = 0; i < n; i++) {
        sp[i + 1] = sp[i] + arts[i].v;
    }

    // vector<triple> diff(n - 1);
    // for(int i = 0; i < n - 1; i++) {
    //     diff[i].a = arts[i + 1].s - arts[i].s;
    //     diff[i].b = i;
    //     diff[i].c = arts[i + 1].v + arts[i].v;
    // }

    ll mx = 0;
    for(int i = 0; i < n; i++) {
        dzielo d = arts[i];
        for(int j = i; j < n; j++) {
            dzielo o = arts[j];
            mx = max(mx, sp[j + 1] - sp[i] - o.s + d.s);
            //cout << d.s << " " << d.v << " dsv " << o.s << " " << o.v << " osv " << i << " " << j << " ij " << sp[j + 1] << " " << sp[i] << endl;
            //cout << sp[j + 1] - sp[i] - o.s + d.s << endl;
        }
    }

    cout << mx;

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 508 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 472 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 12 ms 592 KB Output is correct
28 Correct 11 ms 664 KB Output is correct
29 Correct 11 ms 592 KB Output is correct
30 Correct 11 ms 592 KB Output is correct
31 Correct 11 ms 592 KB Output is correct
32 Correct 11 ms 592 KB Output is correct
33 Correct 11 ms 760 KB Output is correct
34 Correct 11 ms 476 KB Output is correct
35 Correct 11 ms 480 KB Output is correct
36 Correct 14 ms 592 KB Output is correct
37 Correct 11 ms 592 KB Output is correct
38 Correct 13 ms 648 KB Output is correct
39 Correct 11 ms 592 KB Output is correct
40 Correct 11 ms 592 KB Output is correct
41 Correct 11 ms 592 KB Output is correct
42 Correct 12 ms 592 KB Output is correct
43 Correct 11 ms 592 KB Output is correct
44 Correct 10 ms 592 KB Output is correct
45 Correct 11 ms 592 KB Output is correct
46 Correct 11 ms 592 KB Output is correct
47 Correct 11 ms 836 KB Output is correct
48 Correct 11 ms 592 KB Output is correct
49 Correct 11 ms 592 KB Output is correct
50 Correct 11 ms 592 KB Output is correct
51 Correct 11 ms 592 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 508 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 472 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 504 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 12 ms 592 KB Output is correct
28 Correct 11 ms 664 KB Output is correct
29 Correct 11 ms 592 KB Output is correct
30 Correct 11 ms 592 KB Output is correct
31 Correct 11 ms 592 KB Output is correct
32 Correct 11 ms 592 KB Output is correct
33 Correct 11 ms 760 KB Output is correct
34 Correct 11 ms 476 KB Output is correct
35 Correct 11 ms 480 KB Output is correct
36 Correct 14 ms 592 KB Output is correct
37 Correct 11 ms 592 KB Output is correct
38 Correct 13 ms 648 KB Output is correct
39 Correct 11 ms 592 KB Output is correct
40 Correct 11 ms 592 KB Output is correct
41 Correct 11 ms 592 KB Output is correct
42 Correct 12 ms 592 KB Output is correct
43 Correct 11 ms 592 KB Output is correct
44 Correct 10 ms 592 KB Output is correct
45 Correct 11 ms 592 KB Output is correct
46 Correct 11 ms 592 KB Output is correct
47 Correct 11 ms 836 KB Output is correct
48 Correct 11 ms 592 KB Output is correct
49 Correct 11 ms 592 KB Output is correct
50 Correct 11 ms 592 KB Output is correct
51 Correct 11 ms 592 KB Output is correct
52 Execution timed out 1020 ms 23624 KB Time limit exceeded
53 Halted 0 ms 0 KB -