oj.uz

Submission #1108539

# Submission time Handle Problem Language Result Execution time Memory
1108539 2024-11-04T11:25:14 Z vjudge1 Art Exhibition (JOI18_art) C++17
100 / 100
 122 ms 12120 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxN = 5e5 + 5;
pair<ll, ll> arr[maxN];
ll c[maxN];
int n;

int main()
{
    if(fopen("input.txt", "r")){
        freopen("input.txt", "r", stdin);
    }cin.tie(NULL)->sync_with_stdio(false);

    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> arr[i].first >> arr[i].second;
    }
    sort(arr + 1, arr + n + 1);
    for(int i = 1; i < n; ++i)
        c[i] = arr[i].second - arr[i + 1].first + arr[i].first;

    long long mi = 0, s = 0, res = arr[1].second - arr[1].first;
    for(int i = 1; i < n; ++i){
        s += c[i];
        mi = min(mi, s);
        res = max(res, arr[i + 1].second + s - mi);
    }
    cout << res;
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:14:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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 2 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 2 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 2384 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 2552 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 2 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 2384 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 2552 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 3 ms 2384 KB Output is correct
28 Correct 2 ms 2384 KB Output is correct
29 Correct 3 ms 2384 KB Output is correct
30 Correct 2 ms 2384 KB Output is correct
31 Correct 3 ms 2384 KB Output is correct
32 Correct 3 ms 2384 KB Output is correct
33 Correct 2 ms 2384 KB Output is correct
34 Correct 2 ms 2384 KB Output is correct
35 Correct 2 ms 2520 KB Output is correct
36 Correct 2 ms 2384 KB Output is correct
37 Correct 2 ms 2384 KB Output is correct
38 Correct 2 ms 2520 KB Output is correct
39 Correct 2 ms 2384 KB Output is correct
40 Correct 2 ms 2384 KB Output is correct
41 Correct 2 ms 2384 KB Output is correct
42 Correct 2 ms 2384 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2384 KB Output is correct
45 Correct 2 ms 2384 KB Output is correct
46 Correct 2 ms 2384 KB Output is correct
47 Correct 2 ms 2384 KB Output is correct
48 Correct 2 ms 2384 KB Output is correct
49 Correct 2 ms 2384 KB Output is correct
50 Correct 2 ms 2384 KB Output is correct
51 Correct 2 ms 2384 KB Output is correct

Subtask #4
50.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 2 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 2384 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 2552 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 3 ms 2384 KB Output is correct
28 Correct 2 ms 2384 KB Output is correct
29 Correct 3 ms 2384 KB Output is correct
30 Correct 2 ms 2384 KB Output is correct
31 Correct 3 ms 2384 KB Output is correct
32 Correct 3 ms 2384 KB Output is correct
33 Correct 2 ms 2384 KB Output is correct
34 Correct 2 ms 2384 KB Output is correct
35 Correct 2 ms 2520 KB Output is correct
36 Correct 2 ms 2384 KB Output is correct
37 Correct 2 ms 2384 KB Output is correct
38 Correct 2 ms 2520 KB Output is correct
39 Correct 2 ms 2384 KB Output is correct
40 Correct 2 ms 2384 KB Output is correct
41 Correct 2 ms 2384 KB Output is correct
42 Correct 2 ms 2384 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2384 KB Output is correct
45 Correct 2 ms 2384 KB Output is correct
46 Correct 2 ms 2384 KB Output is correct
47 Correct 2 ms 2384 KB Output is correct
48 Correct 2 ms 2384 KB Output is correct
49 Correct 2 ms 2384 KB Output is correct
50 Correct 2 ms 2384 KB Output is correct
51 Correct 2 ms 2384 KB Output is correct
52 Correct 111 ms 11984 KB Output is correct
53 Correct 110 ms 12104 KB Output is correct
54 Correct 112 ms 12120 KB Output is correct
55 Correct 115 ms 12104 KB Output is correct
56 Correct 113 ms 12108 KB Output is correct
57 Correct 116 ms 12104 KB Output is correct
58 Correct 115 ms 11996 KB Output is correct
59 Correct 118 ms 11992 KB Output is correct
60 Correct 120 ms 11988 KB Output is correct
61 Correct 116 ms 11980 KB Output is correct
62 Correct 114 ms 12104 KB Output is correct
63 Correct 116 ms 12104 KB Output is correct
64 Correct 115 ms 12104 KB Output is correct
65 Correct 116 ms 12104 KB Output is correct
66 Correct 115 ms 12104 KB Output is correct
67 Correct 110 ms 12104 KB Output is correct
68 Correct 122 ms 12108 KB Output is correct