Submission #1071593

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1071593	2024-08-23T09:11:31 Z	vjudge1	Art Exhibition (JOI18_art)	C++	50 / 100	17 ms	3676 KB

// Balgabaev Mansur
#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define int long long


using namespace std;

const int N=1e5+7;
const int MOD=1e9+7;
const int INF=1e18;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

pair<int,int>p[N];
pair<int,int>p1[N];
int pref[N];

void solve(){
	int n;
	cin >> n;
	int ans=0;
	for(int i = 1 ; i <= n ; i++){
		cin >> p[i].first >> p[i].second;
	}
	sort(p+1,p+1+n);
	pref[0]=0;
	for(int i = 1 ; i <= n ; i++){
		pref[i]=pref[i-1]+p[i].second;
	}
	for(int i = 1 ; i <= n ; i++){
		for(int j = i ; j <= n ; j++){
			int mx=p[j].first;
			int mn=p[i].first;
			int sm=pref[j]-pref[i-1];
			ans=max(ans,(sm-(mx-mn)));
		}
	}
	cout << ans;
}	
 
signed main() {
   // freopen("closing.in", "r", stdin);
   // freopen("closing.out", "w", stdout);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int test = 1,cntx=1;
    //cin >> test;
    while (test--) {
	//cout << "Case " << 	cntx << ':' << '\n';
        solve();
        cntx++;
	}		
    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	15 ms	348 KB	Output is correct
28	Correct	11 ms	344 KB	Output is correct
29	Correct	10 ms	600 KB	Output is correct
30	Correct	10 ms	588 KB	Output is correct
31	Correct	11 ms	592 KB	Output is correct
32	Correct	11 ms	348 KB	Output is correct
33	Correct	11 ms	348 KB	Output is correct
34	Correct	11 ms	584 KB	Output is correct
35	Correct	11 ms	348 KB	Output is correct
36	Correct	11 ms	348 KB	Output is correct
37	Correct	11 ms	584 KB	Output is correct
38	Correct	11 ms	584 KB	Output is correct
39	Correct	11 ms	348 KB	Output is correct
40	Correct	11 ms	348 KB	Output is correct
41	Correct	10 ms	348 KB	Output is correct
42	Correct	11 ms	348 KB	Output is correct
43	Correct	10 ms	580 KB	Output is correct
44	Correct	15 ms	348 KB	Output is correct
45	Correct	11 ms	348 KB	Output is correct
46	Correct	11 ms	580 KB	Output is correct
47	Correct	10 ms	348 KB	Output is correct
48	Correct	10 ms	584 KB	Output is correct
49	Correct	16 ms	348 KB	Output is correct
50	Correct	11 ms	588 KB	Output is correct
51	Correct	10 ms	348 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	15 ms	348 KB	Output is correct
28	Correct	11 ms	344 KB	Output is correct
29	Correct	10 ms	600 KB	Output is correct
30	Correct	10 ms	588 KB	Output is correct
31	Correct	11 ms	592 KB	Output is correct
32	Correct	11 ms	348 KB	Output is correct
33	Correct	11 ms	348 KB	Output is correct
34	Correct	11 ms	584 KB	Output is correct
35	Correct	11 ms	348 KB	Output is correct
36	Correct	11 ms	348 KB	Output is correct
37	Correct	11 ms	584 KB	Output is correct
38	Correct	11 ms	584 KB	Output is correct
39	Correct	11 ms	348 KB	Output is correct
40	Correct	11 ms	348 KB	Output is correct
41	Correct	10 ms	348 KB	Output is correct
42	Correct	11 ms	348 KB	Output is correct
43	Correct	10 ms	580 KB	Output is correct
44	Correct	15 ms	348 KB	Output is correct
45	Correct	11 ms	348 KB	Output is correct
46	Correct	11 ms	580 KB	Output is correct
47	Correct	10 ms	348 KB	Output is correct
48	Correct	10 ms	584 KB	Output is correct
49	Correct	16 ms	348 KB	Output is correct
50	Correct	11 ms	588 KB	Output is correct
51	Correct	10 ms	348 KB	Output is correct
52	Runtime error	17 ms	3676 KB	Execution killed with signal 11
53	Halted	0 ms	0 KB	-

Submission #1071593

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0