답안 #328629

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
328629	2020-11-17T11:14:51 Z	arayi	Art Exhibition (JOI18_art)	C++17	100 / 100	202 ms	14496 KB

//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int> 
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2LL;
}
mt19937 rnd(363542);
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 0, -1, 0, 1, -1, -1, 1, 1, 0 };
int dy[] = { -1, 0, 1, 0, -1, 1, -1, 1, 0 };


const int N = 5e5 + 30;
const lli mod = 998244353;
const ld pi = acos(-1);
const ld e = 1e-13;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream& operator<<(ostream& c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
struct pt
{
    lli x, y;
    int ind;
    int bl;
    bool operator==(const pt& a)
    {
        return ind == a.ind;
    }
    bool operator<(const pt& b)
    {
        if (x == b.x) return y < b.y;
        return x < b.x;
    }
};



itn n;
pair<lli, lli> a[N];
lli pat, mx[N];
int main()
{
    fastio;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].fr >> a[i].sc;
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++)
        a[i].sc += a[i - 1].sc;
    for (int i = n; i > 0; i--)
    {
        mx[i] = a[i].sc - a[i].fr;
        if (i < n)mx[i] = max(mx[i], mx[i + 1]);
        pat = max(pat, mx[i] + a[i].fr - a[i - 1].sc);
    }
    cout << pat << endl;
    return 0;
}

/*

  __
*(><)*
  \/ /
  ||/
--||
  ||
  /\
 /  \
/    \

*/

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	2 ms	620 KB	Output is correct
28	Correct	3 ms	620 KB	Output is correct
29	Correct	2 ms	620 KB	Output is correct
30	Correct	3 ms	620 KB	Output is correct
31	Correct	2 ms	620 KB	Output is correct
32	Correct	3 ms	620 KB	Output is correct
33	Correct	2 ms	620 KB	Output is correct
34	Correct	2 ms	620 KB	Output is correct
35	Correct	4 ms	620 KB	Output is correct
36	Correct	2 ms	620 KB	Output is correct
37	Correct	2 ms	620 KB	Output is correct
38	Correct	3 ms	620 KB	Output is correct
39	Correct	3 ms	620 KB	Output is correct
40	Correct	2 ms	620 KB	Output is correct
41	Correct	2 ms	620 KB	Output is correct
42	Correct	3 ms	620 KB	Output is correct
43	Correct	3 ms	748 KB	Output is correct
44	Correct	2 ms	620 KB	Output is correct
45	Correct	3 ms	620 KB	Output is correct
46	Correct	3 ms	620 KB	Output is correct
47	Correct	3 ms	620 KB	Output is correct
48	Correct	3 ms	620 KB	Output is correct
49	Correct	3 ms	620 KB	Output is correct
50	Correct	3 ms	620 KB	Output is correct
51	Correct	2 ms	620 KB	Output is correct
52	Correct	201 ms	14492 KB	Output is correct
53	Correct	202 ms	14444 KB	Output is correct
54	Correct	196 ms	14412 KB	Output is correct
55	Correct	198 ms	14444 KB	Output is correct
56	Correct	200 ms	14496 KB	Output is correct
57	Correct	201 ms	14444 KB	Output is correct
58	Correct	197 ms	14444 KB	Output is correct
59	Correct	196 ms	14444 KB	Output is correct
60	Correct	200 ms	14444 KB	Output is correct
61	Correct	197 ms	14444 KB	Output is correct
62	Correct	200 ms	14364 KB	Output is correct
63	Correct	198 ms	14444 KB	Output is correct
64	Correct	202 ms	14444 KB	Output is correct
65	Correct	198 ms	14444 KB	Output is correct
66	Correct	197 ms	14444 KB	Output is correct
67	Correct	198 ms	14444 KB	Output is correct
68	Correct	197 ms	14496 KB	Output is correct

답안 #328629

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