Submission #157787

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
157787	2019-10-12T23:21:21 Z	InfiniteJest	Art Exhibition (JOI18_art)	C++14	50 / 100	187 ms	3860 KB

#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

ifstream in("input.txt");
ofstream out("output.txt");

typedef long long ll;

int n;
pair<ll,ll> v[100001];
ll pref[100001];

int main(){
  cin>>n;
  for(int i=0;i<n;i++)cin>>v[i].fi>>v[i].se;
  sort(v,v+n);
  ll sum=0;
  int ind=0;
  ll mas=-1;
  for(int i=0;i<n;i++){
    sum+=v[i].se;
    pref[i]=sum;
    ll solp=sum-(v[i].fi-v[0].fi);
    if(solp>mas){
      mas=solp;
      ind=i;
    }
  }
  for(int i=1;i<n;i++){
    for(int y=ind;y<n;y++){
      if(y<i)continue;
      ll solp=pref[y]-pref[i-1]-(v[y].fi-v[i].fi);
      if(solp>mas){
        mas=solp;
        ind=y;
      }
    }
  }
  cout<<mas;

}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	452 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	380 KB	Output is correct
13	Correct	3 ms	380 KB	Output is correct
14	Correct	3 ms	380 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	380 KB	Output is correct
18	Correct	3 ms	376 KB	Output is correct
19	Correct	3 ms	380 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	2 ms	372 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	32 ms	632 KB	Output is correct
28	Correct	35 ms	700 KB	Output is correct
29	Correct	33 ms	504 KB	Output is correct
30	Correct	34 ms	696 KB	Output is correct
31	Correct	33 ms	704 KB	Output is correct
32	Correct	34 ms	504 KB	Output is correct
33	Correct	37 ms	504 KB	Output is correct
34	Correct	38 ms	504 KB	Output is correct
35	Correct	33 ms	508 KB	Output is correct
36	Correct	33 ms	532 KB	Output is correct
37	Correct	32 ms	632 KB	Output is correct
38	Correct	30 ms	704 KB	Output is correct
39	Correct	33 ms	504 KB	Output is correct
40	Correct	23 ms	504 KB	Output is correct
41	Correct	15 ms	508 KB	Output is correct
42	Correct	12 ms	504 KB	Output is correct
43	Correct	12 ms	504 KB	Output is correct
44	Correct	12 ms	504 KB	Output is correct
45	Correct	12 ms	632 KB	Output is correct
46	Correct	12 ms	632 KB	Output is correct
47	Correct	12 ms	632 KB	Output is correct
48	Correct	12 ms	632 KB	Output is correct
49	Correct	12 ms	508 KB	Output is correct
50	Correct	12 ms	632 KB	Output is correct
51	Correct	32 ms	504 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	452 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	380 KB	Output is correct
13	Correct	3 ms	380 KB	Output is correct
14	Correct	3 ms	380 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	3 ms	380 KB	Output is correct
18	Correct	3 ms	376 KB	Output is correct
19	Correct	3 ms	380 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	2 ms	372 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	32 ms	632 KB	Output is correct
28	Correct	35 ms	700 KB	Output is correct
29	Correct	33 ms	504 KB	Output is correct
30	Correct	34 ms	696 KB	Output is correct
31	Correct	33 ms	704 KB	Output is correct
32	Correct	34 ms	504 KB	Output is correct
33	Correct	37 ms	504 KB	Output is correct
34	Correct	38 ms	504 KB	Output is correct
35	Correct	33 ms	508 KB	Output is correct
36	Correct	33 ms	532 KB	Output is correct
37	Correct	32 ms	632 KB	Output is correct
38	Correct	30 ms	704 KB	Output is correct
39	Correct	33 ms	504 KB	Output is correct
40	Correct	23 ms	504 KB	Output is correct
41	Correct	15 ms	508 KB	Output is correct
42	Correct	12 ms	504 KB	Output is correct
43	Correct	12 ms	504 KB	Output is correct
44	Correct	12 ms	504 KB	Output is correct
45	Correct	12 ms	632 KB	Output is correct
46	Correct	12 ms	632 KB	Output is correct
47	Correct	12 ms	632 KB	Output is correct
48	Correct	12 ms	632 KB	Output is correct
49	Correct	12 ms	508 KB	Output is correct
50	Correct	12 ms	632 KB	Output is correct
51	Correct	32 ms	504 KB	Output is correct
52	Runtime error	187 ms	3860 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-

Submission #157787

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