Submission #1108500

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1108500	2024-11-04T09:21:58 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	128 ms	8276 KB

#include <bits/stdc++.h>
#define all(dataStructure) dataStructure.begin(),dataStructure.end()

typedef long long ll;

using namespace std;
namespace std {
        template <typename T, int D>
        struct _vector : public vector <_vector <T, D - 1>> {
                static_assert(D >= 1, "Dimension must be positive!");
                template <typename... Args>
                _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
        };
        // _vector <int, 3> a(n, m, k);: int a[n][m][k].
        // _vector <int, 3> a(n, m, k, x);: int a[n][m][k] initialized with x.
        template <typename T>
        struct _vector <T, 1> : public vector <T> {
                _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
        };
}

const int MAX = 500005;
const ll MOD[] = {1000000007, 998244353};

int n;
pair <ll, ll> a[MAX];

void Solve() {
        cin >> n;
        for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
        sort(a + 1, a + n + 1);

        ll sum = 0, best = -a[1].first;
        ll ans = 0;
        
        for (int i = 1; i <= n; i++) {
                sum += a[i].second;
                ans = max(ans, sum - a[i].first - best);
                best = min(best, sum - a[i + 1].first);
        }

        cout << ans;
}

int32_t main() {
        std::ios_base::sync_with_stdio(0);
        std::cin.tie(0); std::cout.tie(0);

        #define TASK ""
        if (fopen(TASK".INP", "r")) {
                freopen(TASK".INP", "r", stdin);
                freopen(TASK".OUT", "w", stdout);
        }
        
        if (fopen("TASK.INP", "r")) {
                freopen("TASK.INP", "r", stdin);
                freopen("TASK.OUT", "w", stdout);
        }
        
        /* int TEST = 1; cin >> TEST; while (TEST--) */ Solve();

        cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
        return 0;
}

Compilation message

art.cpp: In function 'int32_t main()':
art.cpp:51:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |                 freopen(TASK".INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:52:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |                 freopen(TASK".OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:56:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |                 freopen("TASK.INP", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:57:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |                 freopen("TASK.OUT", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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	348 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 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	348 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 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	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 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	508 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	508 KB	Output is correct
22	Correct	1 ms	336 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	348 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 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	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 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	508 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	508 KB	Output is correct
22	Correct	1 ms	336 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	3 ms	504 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	2 ms	476 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	2 ms	476 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	2 ms	336 KB	Output is correct
35	Correct	2 ms	492 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct
37	Correct	2 ms	336 KB	Output is correct
38	Correct	2 ms	336 KB	Output is correct
39	Correct	2 ms	336 KB	Output is correct
40	Correct	2 ms	336 KB	Output is correct
41	Correct	2 ms	336 KB	Output is correct
42	Correct	2 ms	336 KB	Output is correct
43	Correct	2 ms	336 KB	Output is correct
44	Correct	2 ms	336 KB	Output is correct
45	Correct	2 ms	336 KB	Output is correct
46	Correct	2 ms	336 KB	Output is correct
47	Correct	2 ms	336 KB	Output is correct
48	Correct	2 ms	336 KB	Output is correct
49	Correct	2 ms	336 KB	Output is correct
50	Correct	2 ms	336 KB	Output is correct
51	Correct	2 ms	336 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 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	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 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	508 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	508 KB	Output is correct
22	Correct	1 ms	336 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	3 ms	504 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	2 ms	476 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	2 ms	476 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	2 ms	336 KB	Output is correct
35	Correct	2 ms	492 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct
37	Correct	2 ms	336 KB	Output is correct
38	Correct	2 ms	336 KB	Output is correct
39	Correct	2 ms	336 KB	Output is correct
40	Correct	2 ms	336 KB	Output is correct
41	Correct	2 ms	336 KB	Output is correct
42	Correct	2 ms	336 KB	Output is correct
43	Correct	2 ms	336 KB	Output is correct
44	Correct	2 ms	336 KB	Output is correct
45	Correct	2 ms	336 KB	Output is correct
46	Correct	2 ms	336 KB	Output is correct
47	Correct	2 ms	336 KB	Output is correct
48	Correct	2 ms	336 KB	Output is correct
49	Correct	2 ms	336 KB	Output is correct
50	Correct	2 ms	336 KB	Output is correct
51	Correct	2 ms	336 KB	Output is correct
52	Correct	119 ms	8264 KB	Output is correct
53	Correct	114 ms	8264 KB	Output is correct
54	Correct	119 ms	8264 KB	Output is correct
55	Correct	120 ms	8276 KB	Output is correct
56	Correct	116 ms	8264 KB	Output is correct
57	Correct	122 ms	8264 KB	Output is correct
58	Correct	116 ms	8072 KB	Output is correct
59	Correct	116 ms	8072 KB	Output is correct
60	Correct	123 ms	8064 KB	Output is correct
61	Correct	119 ms	8264 KB	Output is correct
62	Correct	124 ms	8268 KB	Output is correct
63	Correct	115 ms	8264 KB	Output is correct
64	Correct	117 ms	8064 KB	Output is correct
65	Correct	124 ms	8076 KB	Output is correct
66	Correct	118 ms	8264 KB	Output is correct
67	Correct	128 ms	8264 KB	Output is correct
68	Correct	115 ms	8264 KB	Output is correct

Submission #1108500

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0