답안 #1050302

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050302	2024-08-09T08:37:16 Z	vjudge1	Art Exhibition (JOI18_art)	C++	50 / 100	1000 ms	17296 KB

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;

int main()
{
    long long n;
    cin >> n;
    pair<long long, long long> q[n];
    for (int i = 0; i < n; i++) {
        cin >> q[i].f >> q[i].s;
    }
    sort(q, q + n);

    vector<pair<long long, long long>> a;
    long long s = 0;
    for (int i = 0; i < n; i++) {
        
        if (i > 0 && q[i].f == q[i - 1].f) {
            s += q[i].s;
            continue;
        } else {
            if (i > 0) {
                a.push_back(make_pair(q[i - 1].f, s));
            }
            s += q[i].s;
        }
    }
    a.push_back(make_pair(q[n - 1].f, s));
    long long m = 0;
    for (int i = 0; i < a.size(); i++) {
        long long r = 0;
        for (int j = i; j < a.size(); j++) {
            if (i - 1 < 0) r = a[j].s;
            else r = a[j].s - a[i - 1].s;
            r = r - (a[j].f - a[i].f);
            m = max(m, r);
        }
        
    }
    cout << m << endl;

    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < a.size(); i++) {
      |                     ~~^~~~~~~~~~
art.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for (int j = i; j < a.size(); j++) {
      |                         ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
12	Correct	0 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	0 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 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

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
12	Correct	0 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	0 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 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	10 ms	604 KB	Output is correct
28	Correct	13 ms	604 KB	Output is correct
29	Correct	12 ms	724 KB	Output is correct
30	Correct	10 ms	604 KB	Output is correct
31	Correct	11 ms	604 KB	Output is correct
32	Correct	10 ms	604 KB	Output is correct
33	Correct	10 ms	604 KB	Output is correct
34	Correct	10 ms	724 KB	Output is correct
35	Correct	11 ms	732 KB	Output is correct
36	Correct	12 ms	732 KB	Output is correct
37	Correct	12 ms	724 KB	Output is correct
38	Correct	12 ms	604 KB	Output is correct
39	Correct	11 ms	604 KB	Output is correct
40	Correct	13 ms	604 KB	Output is correct
41	Correct	11 ms	604 KB	Output is correct
42	Correct	15 ms	508 KB	Output is correct
43	Correct	11 ms	504 KB	Output is correct
44	Correct	12 ms	604 KB	Output is correct
45	Correct	10 ms	728 KB	Output is correct
46	Correct	10 ms	724 KB	Output is correct
47	Correct	10 ms	728 KB	Output is correct
48	Correct	10 ms	600 KB	Output is correct
49	Correct	10 ms	600 KB	Output is correct
50	Correct	10 ms	728 KB	Output is correct
51	Correct	14 ms	604 KB	Output is correct

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
12	Correct	0 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	0 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	344 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	10 ms	604 KB	Output is correct
28	Correct	13 ms	604 KB	Output is correct
29	Correct	12 ms	724 KB	Output is correct
30	Correct	10 ms	604 KB	Output is correct
31	Correct	11 ms	604 KB	Output is correct
32	Correct	10 ms	604 KB	Output is correct
33	Correct	10 ms	604 KB	Output is correct
34	Correct	10 ms	724 KB	Output is correct
35	Correct	11 ms	732 KB	Output is correct
36	Correct	12 ms	732 KB	Output is correct
37	Correct	12 ms	724 KB	Output is correct
38	Correct	12 ms	604 KB	Output is correct
39	Correct	11 ms	604 KB	Output is correct
40	Correct	13 ms	604 KB	Output is correct
41	Correct	11 ms	604 KB	Output is correct
42	Correct	15 ms	508 KB	Output is correct
43	Correct	11 ms	504 KB	Output is correct
44	Correct	12 ms	604 KB	Output is correct
45	Correct	10 ms	728 KB	Output is correct
46	Correct	10 ms	724 KB	Output is correct
47	Correct	10 ms	728 KB	Output is correct
48	Correct	10 ms	600 KB	Output is correct
49	Correct	10 ms	600 KB	Output is correct
50	Correct	10 ms	728 KB	Output is correct
51	Correct	14 ms	604 KB	Output is correct
52	Execution timed out	1034 ms	17296 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #1050302

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