답안 #714249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
714249	2023-03-24T07:02:53 Z	gaga999	Art Exhibition (JOI18_art)	C++17	100 / 100	196 ms	20560 KB

#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb push_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define eps 1e-9
#define F first
#define S second
#define N 500005
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cout << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cout << a << " ", db(b...); }

llt an, mx;
pll ar[N];

signed main()
{
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%lld%lld", &ar[i].F, &ar[i].S);
    sort(ar + 1, ar + n + 1);
    for (int i = 1; i <= n; i++)
    {
        ar[i].S += ar[i - 1].S;
        tmax(mx, ar[i].F - ar[i - 1].S);
        tmax(an, ar[i].S - ar[i].F + mx);
    }
    printf("%lld\n", an);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:83:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
art.cpp:85:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         scanf("%lld%lld", &ar[i].F, &ar[i].S);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	312 KB	Output is correct
4	Correct	1 ms	272 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	308 KB	Output is correct
26	Correct	0 ms	312 KB	Output is correct
27	Correct	2 ms	444 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct
29	Correct	2 ms	468 KB	Output is correct
30	Correct	2 ms	468 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	3 ms	468 KB	Output is correct
33	Correct	2 ms	500 KB	Output is correct
34	Correct	4 ms	428 KB	Output is correct
35	Correct	3 ms	468 KB	Output is correct
36	Correct	2 ms	504 KB	Output is correct
37	Correct	2 ms	496 KB	Output is correct
38	Correct	2 ms	444 KB	Output is correct
39	Correct	2 ms	468 KB	Output is correct
40	Correct	2 ms	468 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	2 ms	468 KB	Output is correct
43	Correct	3 ms	424 KB	Output is correct
44	Correct	2 ms	444 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	2 ms	424 KB	Output is correct
47	Correct	3 ms	468 KB	Output is correct
48	Correct	2 ms	468 KB	Output is correct
49	Correct	3 ms	468 KB	Output is correct
50	Correct	3 ms	468 KB	Output is correct
51	Correct	4 ms	448 KB	Output is correct
52	Correct	164 ms	20428 KB	Output is correct
53	Correct	170 ms	20460 KB	Output is correct
54	Correct	176 ms	20452 KB	Output is correct
55	Correct	163 ms	20424 KB	Output is correct
56	Correct	177 ms	20560 KB	Output is correct
57	Correct	173 ms	20536 KB	Output is correct
58	Correct	169 ms	20372 KB	Output is correct
59	Correct	196 ms	20464 KB	Output is correct
60	Correct	165 ms	20456 KB	Output is correct
61	Correct	174 ms	20420 KB	Output is correct
62	Correct	177 ms	20556 KB	Output is correct
63	Correct	181 ms	20348 KB	Output is correct
64	Correct	181 ms	20396 KB	Output is correct
65	Correct	165 ms	20428 KB	Output is correct
66	Correct	170 ms	20460 KB	Output is correct
67	Correct	169 ms	20420 KB	Output is correct
68	Correct	165 ms	20428 KB	Output is correct

답안 #714249

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