답안 #1086059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1086059	2024-09-09T12:24:42 Z	kiethm07	Art Exhibition (JOI18_art)	C++11	100 / 100	132 ms	24964 KB

#include <bits/stdc++.h>

#define pii pair<int,int>
#define iii pair<int,pii>
#define fi first
#define se second

#define vi vector<int>
#define all(x) x.begin(),x.end()

#define TEXT "a"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int inf = 1e9 + 7;
const ld eps = 1e-8;
const double pi = acos(-1);
const int N = 5e5 + 5;

struct node{
    ll a, b;
    bool operator < (const node& N) const{
        if (a != N.a) return a < N.a;
        return b < N.b;
    }
    node(){}
};

int n;
node v[N];
ll p[N];

ll backtrack(ll M, ll m, ll s, ll i){
    if (i > n){
        if (M == LLONG_MIN) return LLONG_MIN;
        return s - (M - m);
    }
    ll res = LLONG_MIN;
    res = max(res,backtrack(max(M,v[i].a),min(m,v[i].a), s + v[i].b, i + 1));
    res = max(res,backtrack(M,m,s,i + 1));
    return res;
}

int main(){
    cin.tie(0) -> sync_with_stdio(0);
    if (fopen(TEXT".inp","r")){
        freopen(TEXT".inp","r",stdin);
        freopen(TEXT".out","w",stdout);
    }
    ll res = LLONG_MIN;
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> v[i].a >> v[i].b;
    }
    sort(v + 1,v + 1 + n);
    for (int i = 1; i <= n; i++){
        p[i] = p[i - 1] + v[i].b;
        //cout << i << " " << v[i].a << " " << v[i].b << " " << p[i] << "\n";
    }
    ll cur = LLONG_MIN;
    for (int i = 1; i <= n; i++){
        cur = max(cur,v[i].a - p[i - 1]);
        res = max(res,p[i] - v[i].a + cur);
    }
    cout << res << "\n";
    //cout << backtrack(LLONG_MIN, LLONG_MAX, 0, 1) << "\n";
    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen(TEXT".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
art.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen(TEXT".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 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	0 ms	348 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	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 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	0 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	464 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 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	0 ms	348 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	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 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	0 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	464 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 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	1 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	2 ms	600 KB	Output is correct
31	Correct	1 ms	524 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	1 ms	676 KB	Output is correct
34	Correct	1 ms	644 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	1 ms	472 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	668 KB	Output is correct
42	Correct	2 ms	604 KB	Output is correct
43	Correct	1 ms	496 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	592 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	1 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	0 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	464 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 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	1 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	2 ms	600 KB	Output is correct
31	Correct	1 ms	524 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	1 ms	676 KB	Output is correct
34	Correct	1 ms	644 KB	Output is correct
35	Correct	1 ms	604 KB	Output is correct
36	Correct	2 ms	604 KB	Output is correct
37	Correct	1 ms	472 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	668 KB	Output is correct
42	Correct	2 ms	604 KB	Output is correct
43	Correct	1 ms	496 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	1 ms	592 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	1 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	2 ms	604 KB	Output is correct
51	Correct	2 ms	604 KB	Output is correct
52	Correct	122 ms	24660 KB	Output is correct
53	Correct	132 ms	24656 KB	Output is correct
54	Correct	125 ms	24660 KB	Output is correct
55	Correct	125 ms	24636 KB	Output is correct
56	Correct	129 ms	24796 KB	Output is correct
57	Correct	121 ms	24656 KB	Output is correct
58	Correct	119 ms	24964 KB	Output is correct
59	Correct	120 ms	24660 KB	Output is correct
60	Correct	118 ms	24656 KB	Output is correct
61	Correct	123 ms	24504 KB	Output is correct
62	Correct	117 ms	24656 KB	Output is correct
63	Correct	119 ms	24732 KB	Output is correct
64	Correct	121 ms	24656 KB	Output is correct
65	Correct	122 ms	24820 KB	Output is correct
66	Correct	129 ms	24668 KB	Output is correct
67	Correct	132 ms	24656 KB	Output is correct
68	Correct	130 ms	24784 KB	Output is correct

답안 #1086059

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