답안 #632427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
632427	2022-08-20T03:39:49 Z	iomoon191	Art Exhibition (JOI18_art)	C++17	100 / 100	209 ms	16272 KB

#include<bits/stdc++.h>
#define int long long
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
#define eb emplace_back
#define For(i,a,b) for(int i=(a); i<=(b); ++i)
#define roF(i,a,b) for(int i=(a); i>=(b); --i)
#define fi first
#define se second
#define mod 998244353
using namespace std;
// using namespace atcoder;
#ifdef DEBUG__
struct db_os{
    ostream& os;
    bool chk;
    template<class T> auto operator<<(T&& x){
        if(!chk) os << ", ";
        chk=0;
        os << x;
        return *this;
    }
};
template<class... T> void db_out(T&&... t){
    (db_os{cerr, 1} << ... << t);
}
#define dbg(...)                                       \
    do{                                                 \
        cerr << __LINE__ << ":" << #__VA_ARGS__ << "=";  \
        db_out(__VA_ARGS__);                              \
        cerr << "\n";                                      \
    }while(0);
#else
#define dbg(...)
#endif
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
typedef long double ld;
const int N=500005;
const ll inf=0x3f3f3f3f;
mt19937 rng(random_device {}()); 
int rand(int a){
    return rng()%a;
}
int n;
pi a[N];
void rmain(){
    cin >> n;
    For(i,1,n) cin >> a[i].fi >> a[i].se;
    sort(a+1, a+n+1);
    For(i,1,n) a[i].se+=a[i-1].se;
    int S=-inf, res=0;
    For(i,1,n){
        S=max(S, a[i].fi-a[i-1].se);
        res=max(res, S+a[i].se-a[i].fi);
    }
    cout << res;
}
signed main(int argc, char *argv[]){
    iostream::sync_with_stdio(0);
    int T=1;
    while(T--) rmain();
    return 0;
}

Compilation message

art.cpp:61:8: warning: first argument of 'int main(long long int, char**)' should be 'int' [-Wmain]
   61 | signed main(int argc, char *argv[]){
      |        ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	2 ms	476 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	476 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	2 ms	480 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	476 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	3 ms	468 KB	Output is correct
38	Correct	2 ms	468 KB	Output is correct
39	Correct	2 ms	468 KB	Output is correct
40	Correct	3 ms	528 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	2 ms	476 KB	Output is correct
43	Correct	3 ms	512 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	3 ms	452 KB	Output is correct
47	Correct	2 ms	468 KB	Output is correct
48	Correct	2 ms	468 KB	Output is correct
49	Correct	2 ms	484 KB	Output is correct
50	Correct	2 ms	448 KB	Output is correct
51	Correct	2 ms	468 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	0 ms	336 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	2 ms	476 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	476 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	2 ms	480 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	2 ms	476 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Correct	2 ms	468 KB	Output is correct
37	Correct	3 ms	468 KB	Output is correct
38	Correct	2 ms	468 KB	Output is correct
39	Correct	2 ms	468 KB	Output is correct
40	Correct	3 ms	528 KB	Output is correct
41	Correct	2 ms	468 KB	Output is correct
42	Correct	2 ms	476 KB	Output is correct
43	Correct	3 ms	512 KB	Output is correct
44	Correct	2 ms	468 KB	Output is correct
45	Correct	2 ms	468 KB	Output is correct
46	Correct	3 ms	452 KB	Output is correct
47	Correct	2 ms	468 KB	Output is correct
48	Correct	2 ms	468 KB	Output is correct
49	Correct	2 ms	484 KB	Output is correct
50	Correct	2 ms	448 KB	Output is correct
51	Correct	2 ms	468 KB	Output is correct
52	Correct	209 ms	12272 KB	Output is correct
53	Correct	180 ms	16076 KB	Output is correct
54	Correct	191 ms	16076 KB	Output is correct
55	Correct	178 ms	16068 KB	Output is correct
56	Correct	180 ms	15976 KB	Output is correct
57	Correct	180 ms	16272 KB	Output is correct
58	Correct	180 ms	15984 KB	Output is correct
59	Correct	190 ms	16172 KB	Output is correct
60	Correct	182 ms	16012 KB	Output is correct
61	Correct	187 ms	16020 KB	Output is correct
62	Correct	185 ms	15948 KB	Output is correct
63	Correct	175 ms	16068 KB	Output is correct
64	Correct	182 ms	16020 KB	Output is correct
65	Correct	180 ms	16124 KB	Output is correct
66	Correct	178 ms	15960 KB	Output is correct
67	Correct	209 ms	15944 KB	Output is correct
68	Correct	180 ms	15924 KB	Output is correct

답안 #632427

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