답안 #1116851

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116851	2024-11-22T13:22:38 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	28488 KB

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort 
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second

# pragma GCC optimize("O2")
//pragma GCC optimize("my solution")

using namespace __gnu_pbds;
using namespace std;

typedef tree<long long, null_type, less_equal<long long>,
    rb_tree_tag, tree_order_statistics_node_update> Tree;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 1e9 + 7; //[998244353, 1e9 + 7, 1e9 + 13]

ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}

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

        int n;
        cin >> n;

        vector<pair<ll, ll>> v(n + 1);

        for (int i = 1; i <= n; i ++) 
                cin >> v[i].F >> v[i].S;
        stable_sort(v.begin() + 1, v.end());

        ll ans = 0;
        for (int i = 1; i <= n; i ++) {
                ll sum = 0;
                for (int j = i; j <= n; j ++) {
                        sum += v[j].S;
                        ans = max(ans, sum - (v[j].F - v[i].F));
                }
        } 

        cout << ans << '\n';

        return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	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	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

#	결과	실행 시간	메모리	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	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	2 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	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	504 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	500 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	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	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	2 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	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	504 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	500 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	11 ms	592 KB	Output is correct
28	Correct	11 ms	592 KB	Output is correct
29	Correct	11 ms	592 KB	Output is correct
30	Correct	10 ms	592 KB	Output is correct
31	Correct	11 ms	748 KB	Output is correct
32	Correct	11 ms	592 KB	Output is correct
33	Correct	11 ms	592 KB	Output is correct
34	Correct	11 ms	728 KB	Output is correct
35	Correct	11 ms	748 KB	Output is correct
36	Correct	19 ms	592 KB	Output is correct
37	Correct	11 ms	592 KB	Output is correct
38	Correct	10 ms	592 KB	Output is correct
39	Correct	12 ms	684 KB	Output is correct
40	Correct	11 ms	592 KB	Output is correct
41	Correct	10 ms	592 KB	Output is correct
42	Correct	18 ms	592 KB	Output is correct
43	Correct	11 ms	652 KB	Output is correct
44	Correct	11 ms	592 KB	Output is correct
45	Correct	11 ms	764 KB	Output is correct
46	Correct	11 ms	764 KB	Output is correct
47	Correct	10 ms	744 KB	Output is correct
48	Correct	11 ms	592 KB	Output is correct
49	Correct	10 ms	592 KB	Output is correct
50	Correct	10 ms	592 KB	Output is correct
51	Correct	10 ms	748 KB	Output is correct

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	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	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	2 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	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	504 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	500 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	11 ms	592 KB	Output is correct
28	Correct	11 ms	592 KB	Output is correct
29	Correct	11 ms	592 KB	Output is correct
30	Correct	10 ms	592 KB	Output is correct
31	Correct	11 ms	748 KB	Output is correct
32	Correct	11 ms	592 KB	Output is correct
33	Correct	11 ms	592 KB	Output is correct
34	Correct	11 ms	728 KB	Output is correct
35	Correct	11 ms	748 KB	Output is correct
36	Correct	19 ms	592 KB	Output is correct
37	Correct	11 ms	592 KB	Output is correct
38	Correct	10 ms	592 KB	Output is correct
39	Correct	12 ms	684 KB	Output is correct
40	Correct	11 ms	592 KB	Output is correct
41	Correct	10 ms	592 KB	Output is correct
42	Correct	18 ms	592 KB	Output is correct
43	Correct	11 ms	652 KB	Output is correct
44	Correct	11 ms	592 KB	Output is correct
45	Correct	11 ms	764 KB	Output is correct
46	Correct	11 ms	764 KB	Output is correct
47	Correct	10 ms	744 KB	Output is correct
48	Correct	11 ms	592 KB	Output is correct
49	Correct	10 ms	592 KB	Output is correct
50	Correct	10 ms	592 KB	Output is correct
51	Correct	10 ms	748 KB	Output is correct
52	Execution timed out	1036 ms	28488 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #1116851

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0