답안 #843812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
843812	2023-09-04T15:19:09 Z	Iliya_	Art Exhibition (JOI18_art)	C++17	100 / 100	174 ms	35140 KB

//IN THE NAME OF GOD
#include<bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
#define endl '\n'
#define F first
#define S second
using namespace std; 
typedef long long ll; 
typedef long double dll;

ll N = 5e5+7; 
vector<pair<ll,ll>> v, hav; 

int32_t main(){
     ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);  

     ll n; cin >> n; 
     for(ll i=1; i<=n; i++){
          ll a,b; cin >> a >> b; 
          v.push_back({a,b}); 
     }
     sort(v.begin(),v.end()); 
     hav.push_back(v[0]); 
     for(ll i=1; i<n; i++){
          if (v[i].F == hav.back().F) hav.back().S += v[i].S; 
          else hav.push_back(v[i]);
     }
     ll ans = 0, tmp = 0; 
     for(ll i=ll(hav.size())-1; i>=0; i--){
          ans = max(ans, hav[i].S);
          if (i == int(hav.size())-1) tmp = hav[i].S;
          else tmp = max(hav[i].S,tmp+hav[i].S-hav[i+1].F+hav[i].F); 
          ans = max(ans, tmp); 
     }
     cout << ans << endl; 

     return 0; 
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	500 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 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	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	500 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	452 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	456 KB	Output is correct
21	Correct	1 ms	456 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	460 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	0 ms	600 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	500 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	452 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	456 KB	Output is correct
21	Correct	1 ms	456 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	460 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	0 ms	600 KB	Output is correct
27	Correct	2 ms	860 KB	Output is correct
28	Correct	3 ms	724 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	856 KB	Output is correct
31	Correct	2 ms	856 KB	Output is correct
32	Correct	2 ms	860 KB	Output is correct
33	Correct	3 ms	784 KB	Output is correct
34	Correct	2 ms	780 KB	Output is correct
35	Correct	2 ms	780 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	2 ms	852 KB	Output is correct
38	Correct	2 ms	860 KB	Output is correct
39	Correct	2 ms	980 KB	Output is correct
40	Correct	2 ms	856 KB	Output is correct
41	Correct	2 ms	856 KB	Output is correct
42	Correct	2 ms	860 KB	Output is correct
43	Correct	2 ms	852 KB	Output is correct
44	Correct	2 ms	860 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	860 KB	Output is correct
47	Correct	2 ms	776 KB	Output is correct
48	Correct	2 ms	860 KB	Output is correct
49	Correct	3 ms	856 KB	Output is correct
50	Correct	2 ms	856 KB	Output is correct
51	Correct	2 ms	856 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	500 KB	Output is correct
6	Correct	0 ms	456 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	452 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	344 KB	Output is correct
20	Correct	0 ms	456 KB	Output is correct
21	Correct	1 ms	456 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	1 ms	460 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	0 ms	600 KB	Output is correct
27	Correct	2 ms	860 KB	Output is correct
28	Correct	3 ms	724 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	856 KB	Output is correct
31	Correct	2 ms	856 KB	Output is correct
32	Correct	2 ms	860 KB	Output is correct
33	Correct	3 ms	784 KB	Output is correct
34	Correct	2 ms	780 KB	Output is correct
35	Correct	2 ms	780 KB	Output is correct
36	Correct	2 ms	860 KB	Output is correct
37	Correct	2 ms	852 KB	Output is correct
38	Correct	2 ms	860 KB	Output is correct
39	Correct	2 ms	980 KB	Output is correct
40	Correct	2 ms	856 KB	Output is correct
41	Correct	2 ms	856 KB	Output is correct
42	Correct	2 ms	860 KB	Output is correct
43	Correct	2 ms	852 KB	Output is correct
44	Correct	2 ms	860 KB	Output is correct
45	Correct	2 ms	860 KB	Output is correct
46	Correct	2 ms	860 KB	Output is correct
47	Correct	2 ms	776 KB	Output is correct
48	Correct	2 ms	860 KB	Output is correct
49	Correct	3 ms	856 KB	Output is correct
50	Correct	2 ms	856 KB	Output is correct
51	Correct	2 ms	856 KB	Output is correct
52	Correct	152 ms	33708 KB	Output is correct
53	Correct	148 ms	33088 KB	Output is correct
54	Correct	144 ms	33856 KB	Output is correct
55	Correct	164 ms	33508 KB	Output is correct
56	Correct	146 ms	33984 KB	Output is correct
57	Correct	151 ms	33320 KB	Output is correct
58	Correct	146 ms	35140 KB	Output is correct
59	Correct	143 ms	34424 KB	Output is correct
60	Correct	143 ms	34020 KB	Output is correct
61	Correct	162 ms	33204 KB	Output is correct
62	Correct	174 ms	34524 KB	Output is correct
63	Correct	138 ms	34992 KB	Output is correct
64	Correct	141 ms	33684 KB	Output is correct
65	Correct	141 ms	34744 KB	Output is correct
66	Correct	139 ms	34736 KB	Output is correct
67	Correct	141 ms	34232 KB	Output is correct
68	Correct	138 ms	34484 KB	Output is correct

답안 #843812

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