답안 #939595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
939595	2024-03-06T14:45:27 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	138 ms	24764 KB

#include <bits/stdc++.h>

#pragma optimize("Ofast")
#pragma target("avx2")

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define mem(a,i) memset(a,i,sizeof(a))
#define sz(s) (int)s.size()
#define y1 yy
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound
#define gcd(a,b) __gcd(a,b)
#define in insert
#define int ll

const int MAX=5e5+15;
const int B=2e5;
const int N=104;
const int block=450;
const int maxB=MAX/B+10;
const ll inf=1e18;  
const int mod=1e9+7;
const int mod1=1e9+9;
const ld eps=1e-9;

int dx[8]={1,0,-1,0,1,-1,-1,1};
int dy[8]={0,1,0,-1,1,-1,1,-1};

int binpow(int a,int n){
  if(!n)return 1;
  if(n%2==1)return a*binpow(a,n-1);
  int k=binpow(a,n/2);
  return k*k;
}

int n;
pii a[MAX];
int p[MAX];

void solve(){
  cin>>n;
  for(int i=1;i<=n;i++)cin>>a[i].F>>a[i].S;
  sort(a+1,a+n+1);
  for(int i=1;i<=n;i++){
    p[i]=p[i-1]+a[i].S;
  }
  int mx=-inf;
  int ans=0;
  for(int i=n;i>=1;i--){
    mx=max(mx,p[i]-a[i].F);
    ans=max(ans,mx-p[i-1]+a[i].F);
  }
  cout<<ans<<"\n";
}

signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // prec();
  int t=1;
  // cin>>t;
  while(t--)solve();
}

Compilation message

art.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("Ofast")
      | 
art.cpp:4: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    4 | #pragma target("avx2")
      |

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2516 KB	Output is correct
7	Correct	1 ms	2512 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2392 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2520 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2392 KB	Output is correct
23	Correct	1 ms	2392 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	2 ms	2652 KB	Output is correct
28	Correct	2 ms	2648 KB	Output is correct
29	Correct	2 ms	2652 KB	Output is correct
30	Correct	2 ms	2524 KB	Output is correct
31	Correct	2 ms	2652 KB	Output is correct
32	Correct	2 ms	2652 KB	Output is correct
33	Correct	2 ms	2520 KB	Output is correct
34	Correct	2 ms	2628 KB	Output is correct
35	Correct	2 ms	2652 KB	Output is correct
36	Correct	2 ms	2652 KB	Output is correct
37	Correct	2 ms	2652 KB	Output is correct
38	Correct	2 ms	2652 KB	Output is correct
39	Correct	2 ms	2652 KB	Output is correct
40	Correct	2 ms	2652 KB	Output is correct
41	Correct	2 ms	2652 KB	Output is correct
42	Correct	2 ms	2652 KB	Output is correct
43	Correct	2 ms	2652 KB	Output is correct
44	Correct	2 ms	2524 KB	Output is correct
45	Correct	2 ms	2652 KB	Output is correct
46	Correct	2 ms	2624 KB	Output is correct
47	Correct	2 ms	2652 KB	Output is correct
48	Correct	2 ms	2652 KB	Output is correct
49	Correct	2 ms	2648 KB	Output is correct
50	Correct	2 ms	2652 KB	Output is correct
51	Correct	3 ms	2652 KB	Output is correct
52	Correct	129 ms	24580 KB	Output is correct
53	Correct	131 ms	24636 KB	Output is correct
54	Correct	127 ms	24656 KB	Output is correct
55	Correct	131 ms	24620 KB	Output is correct
56	Correct	129 ms	24636 KB	Output is correct
57	Correct	129 ms	24684 KB	Output is correct
58	Correct	128 ms	24656 KB	Output is correct
59	Correct	129 ms	24660 KB	Output is correct
60	Correct	127 ms	24656 KB	Output is correct
61	Correct	138 ms	24656 KB	Output is correct
62	Correct	130 ms	24636 KB	Output is correct
63	Correct	128 ms	24752 KB	Output is correct
64	Correct	129 ms	24660 KB	Output is correct
65	Correct	130 ms	24764 KB	Output is correct
66	Correct	128 ms	24632 KB	Output is correct
67	Correct	129 ms	24656 KB	Output is correct
68	Correct	132 ms	24660 KB	Output is correct

답안 #939595

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