Submission #103347

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
103347	2019-03-29T20:22:25 Z	tincamatei	Art Exhibition (JOI18_art)	C++14	50 / 100	1000 ms	20856 KB

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 500000;

struct Paint {
	long long a, b;
}v[1+MAX_N];

bool cmp(Paint a, Paint b) {
	return a.a < b.a;
}

int main() {
#ifdef HOME
	FILE *fin = fopen("input.in", "r");
	FILE *fout = fopen("output.out", "w");
#else
	FILE *fin = stdin;
	FILE *fout = stdout;
#endif

	int n;
	long long best, rez, sp;

	fscanf(fin, "%d", &n);

	for(int i = 0; i < n; ++i)
		fscanf(fin, "%lld%lld", &v[i].a, &v[i].b);
	sort(v, v + n, cmp);
	
	sp = rez = 0LL;
	best = v[0].a;
	
	/*for(int i = 1; i < (1 << n); ++i) {
		long long minA, maxA, sum;
		minA = 1LL<<60;
		maxA = -1;
		sum = 0LL;

		for(int j = 0; j < n; ++j)
			if((1 << j) & i) {
				sum += v[j].b;
				minA = min(minA, v[j].a);
				maxA = max(maxA, v[j].a);
			}
		
		rez = max(rez, sum - (maxA - minA));
	}*/

	for(int i = 0; i < n; ++i) {
		sp = 0LL;
		for(int j = i; j < n; ++j) {
			sp += v[j].b;
			rez = max(rez, sp - v[j].a + v[i].a);
			//if(sp - v[j].a + v[i].a == rez)
				//printf("%d %d->%lld\n", i, j, sp - v[j].a + v[i].a);
		}
	}

	/*for(int i = 0; i < n; ++i) {
		printf("%lld %lld\n", v[i].a, v[i].b);
		sp = sp + v[i].b;
		rez = max(rez, sp - v[i].a + best);

		best = max(best, -sp + v[i].b + v[i].a);
		printf("!%lld\n", sp);
	} */

	fprintf(fout, "%lld", rez);

	fclose(fin);
	fclose(fout);
	return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:25:12: warning: variable 'best' set but not used [-Wunused-but-set-variable]
  long long best, rez, sp;
            ^~~~
art.cpp:27:8: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fscanf(fin, "%d", &n);
  ~~~~~~^~~~~~~~~~~~~~~
art.cpp:30:9: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   fscanf(fin, "%lld%lld", &v[i].a, &v[i].b);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	9 ms	256 KB	Output is correct
8	Correct	3 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	256 KB	Output is correct
11	Correct	2 ms	384 KB	Output is correct
12	Correct	3 ms	384 KB	Output is correct
13	Correct	2 ms	320 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	3 ms	384 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	2 ms	512 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	2 ms	384 KB	Output is correct
22	Correct	2 ms	384 KB	Output is correct
23	Correct	2 ms	384 KB	Output is correct
24	Correct	3 ms	384 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	29 ms	572 KB	Output is correct
28	Correct	23 ms	512 KB	Output is correct
29	Correct	19 ms	512 KB	Output is correct
30	Correct	19 ms	512 KB	Output is correct
31	Correct	25 ms	640 KB	Output is correct
32	Correct	19 ms	512 KB	Output is correct
33	Correct	27 ms	512 KB	Output is correct
34	Correct	21 ms	512 KB	Output is correct
35	Correct	19 ms	512 KB	Output is correct
36	Correct	20 ms	512 KB	Output is correct
37	Correct	20 ms	512 KB	Output is correct
38	Correct	25 ms	512 KB	Output is correct
39	Correct	20 ms	512 KB	Output is correct
40	Correct	21 ms	512 KB	Output is correct
41	Correct	29 ms	640 KB	Output is correct
42	Correct	29 ms	512 KB	Output is correct
43	Correct	21 ms	512 KB	Output is correct
44	Correct	22 ms	512 KB	Output is correct
45	Correct	26 ms	512 KB	Output is correct
46	Correct	23 ms	512 KB	Output is correct
47	Correct	20 ms	512 KB	Output is correct
48	Correct	22 ms	512 KB	Output is correct
49	Correct	22 ms	576 KB	Output is correct
50	Correct	29 ms	512 KB	Output is correct
51	Correct	20 ms	512 KB	Output is correct
52	Execution timed out	1073 ms	20856 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #103347

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