답안 #242681

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
242681	2020-06-29T01:09:17 Z	WhaleVomit	Art Exhibition (JOI18_art)	C++14	100 / 100	257 ms	29288 KB

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()

#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;

int main() { FAST
    int n; cin >> n;
    vector<pair<ll,ll>> arr(n);
    M00(i, n) cin >> arr[i].f >> arr[i].s;
    sort(all(arr));
    vector<ll> v;
    M00(i, n) {
        v.pb(arr[i].s);
        if(i != n-1) v.pb(arr[i].f-arr[i+1].f);
    }
    ll mx = 0;
    ll cur = 0;
    M00(i, sz(v)) {
        cur = max(cur+v[i], v[i]);
        mx = max(mx, cur);
    }
    finish(mx);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	432 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	6 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	8 ms	768 KB	Output is correct
28	Correct	8 ms	768 KB	Output is correct
29	Correct	7 ms	768 KB	Output is correct
30	Correct	7 ms	768 KB	Output is correct
31	Correct	7 ms	768 KB	Output is correct
32	Correct	8 ms	768 KB	Output is correct
33	Correct	7 ms	768 KB	Output is correct
34	Correct	7 ms	768 KB	Output is correct
35	Correct	7 ms	768 KB	Output is correct
36	Correct	7 ms	768 KB	Output is correct
37	Correct	7 ms	768 KB	Output is correct
38	Correct	7 ms	768 KB	Output is correct
39	Correct	7 ms	768 KB	Output is correct
40	Correct	7 ms	768 KB	Output is correct
41	Correct	9 ms	768 KB	Output is correct
42	Correct	7 ms	768 KB	Output is correct
43	Correct	7 ms	768 KB	Output is correct
44	Correct	7 ms	768 KB	Output is correct
45	Correct	7 ms	768 KB	Output is correct
46	Correct	7 ms	768 KB	Output is correct
47	Correct	6 ms	768 KB	Output is correct
48	Correct	9 ms	768 KB	Output is correct
49	Correct	7 ms	768 KB	Output is correct
50	Correct	7 ms	768 KB	Output is correct
51	Correct	7 ms	768 KB	Output is correct
52	Correct	221 ms	29160 KB	Output is correct
53	Correct	227 ms	29288 KB	Output is correct
54	Correct	232 ms	29160 KB	Output is correct
55	Correct	238 ms	29160 KB	Output is correct
56	Correct	223 ms	29288 KB	Output is correct
57	Correct	254 ms	29160 KB	Output is correct
58	Correct	257 ms	29160 KB	Output is correct
59	Correct	235 ms	29160 KB	Output is correct
60	Correct	232 ms	29160 KB	Output is correct
61	Correct	240 ms	29032 KB	Output is correct
62	Correct	229 ms	29288 KB	Output is correct
63	Correct	226 ms	29160 KB	Output is correct
64	Correct	234 ms	29160 KB	Output is correct
65	Correct	241 ms	29160 KB	Output is correct
66	Correct	241 ms	29160 KB	Output is correct
67	Correct	228 ms	29288 KB	Output is correct
68	Correct	237 ms	29288 KB	Output is correct

답안 #242681

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