답안 #1093816

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093816	2024-09-27T15:10:54 Z	Flandre	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	24404 KB

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define SZ(x) ((int)((x).size()))
#define pow2(x) ((ll)(x) * (x))
const ll mod = 1e9 + 7;
const int INF = 1e9 + 5; // 998244353
const ll INFF = 1e18 + 5;
// Super is the cutest girl
void solve()
{
    int n;
    cin >> n;
    vector<pll> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i].fi >> v[i].se;
    }
    sort(all(v));
    vl pref(n + 1);
    for (int i = 0; i < n; i++)
    {
        pref[i + 1] = pref[i] + v[i].se;
    }
    ll ans = 0;
    ll curr = 0;
    int l = 0;
    for (int i = 0; i < n; i++)
    {
        curr += v[i].se;
        ll xd = curr - (v[i].fi - v[l].fi);
        if (xd < ans)
        {
                }
        ans = max(ans, curr - (v[i].fi - v[l].fi));
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = i; j < n; j++)
        {
            ans = max(ans, pref[j + 1] - pref[i] - (v[j].fi - v[i].fi));
        }
    }
    cout << ans << '\n';
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    // int t; cin >> t; while(t--)
    solve();
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	448 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	448 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	460 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	448 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	460 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	10 ms	460 KB	Output is correct
28	Correct	12 ms	604 KB	Output is correct
29	Correct	10 ms	696 KB	Output is correct
30	Correct	10 ms	700 KB	Output is correct
31	Correct	10 ms	604 KB	Output is correct
32	Correct	10 ms	696 KB	Output is correct
33	Correct	10 ms	704 KB	Output is correct
34	Correct	10 ms	604 KB	Output is correct
35	Correct	10 ms	708 KB	Output is correct
36	Correct	10 ms	604 KB	Output is correct
37	Correct	10 ms	604 KB	Output is correct
38	Correct	10 ms	468 KB	Output is correct
39	Correct	10 ms	600 KB	Output is correct
40	Correct	10 ms	600 KB	Output is correct
41	Correct	10 ms	696 KB	Output is correct
42	Correct	10 ms	468 KB	Output is correct
43	Correct	12 ms	604 KB	Output is correct
44	Correct	14 ms	600 KB	Output is correct
45	Correct	10 ms	604 KB	Output is correct
46	Correct	10 ms	704 KB	Output is correct
47	Correct	10 ms	604 KB	Output is correct
48	Correct	10 ms	604 KB	Output is correct
49	Correct	10 ms	600 KB	Output is correct
50	Correct	10 ms	696 KB	Output is correct
51	Correct	10 ms	600 KB	Output is correct

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	448 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	460 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	10 ms	460 KB	Output is correct
28	Correct	12 ms	604 KB	Output is correct
29	Correct	10 ms	696 KB	Output is correct
30	Correct	10 ms	700 KB	Output is correct
31	Correct	10 ms	604 KB	Output is correct
32	Correct	10 ms	696 KB	Output is correct
33	Correct	10 ms	704 KB	Output is correct
34	Correct	10 ms	604 KB	Output is correct
35	Correct	10 ms	708 KB	Output is correct
36	Correct	10 ms	604 KB	Output is correct
37	Correct	10 ms	604 KB	Output is correct
38	Correct	10 ms	468 KB	Output is correct
39	Correct	10 ms	600 KB	Output is correct
40	Correct	10 ms	600 KB	Output is correct
41	Correct	10 ms	696 KB	Output is correct
42	Correct	10 ms	468 KB	Output is correct
43	Correct	12 ms	604 KB	Output is correct
44	Correct	14 ms	600 KB	Output is correct
45	Correct	10 ms	604 KB	Output is correct
46	Correct	10 ms	704 KB	Output is correct
47	Correct	10 ms	604 KB	Output is correct
48	Correct	10 ms	604 KB	Output is correct
49	Correct	10 ms	600 KB	Output is correct
50	Correct	10 ms	696 KB	Output is correct
51	Correct	10 ms	600 KB	Output is correct
52	Execution timed out	1041 ms	24404 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #1093816

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