oj.uz

Submission #223571

# Submission time Handle Problem Language Result Execution time Memory
223571 2020-04-15T13:29:25 Z Ruxandra985 Art Exhibition (JOI18_art) C++14
100 / 100
 300 ms 20984 KB 
#include <bits/stdc++.h>

using namespace std;
pair <long long , long long> v[500010];
int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int n , i;
    long long curr , sol;
    fscanf (fin,"%d",&n);
    for (i = 1 ; i <= n ; i++){
        fscanf (fin,"%lld%lld",&v[i].first,&v[i].second);
    }

    sort (v + 1 , v + n + 1);

    curr = sol = 0;

    for (i = 1 ; i <= n ; i++){
        if (curr >= 0)
            curr += v[i].first - v[i + 1].first + v[i].second;
        else curr = v[i].first - v[i + 1].first + v[i].second;

        sol = max(sol , v[i].second);
        if (i + 1 <= n)
            sol = max(sol , curr + v[i + 1].second);
    }

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

    return 0;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:11:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d",&n);
     ~~~~~~~^~~~~~~~~~~~~
art.cpp:13:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%lld%lld",&v[i].first,&v[i].second);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 380 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 7 ms 512 KB Output is correct
28 Correct 7 ms 512 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 7 ms 512 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 7 ms 512 KB Output is correct
33 Correct 7 ms 512 KB Output is correct
34 Correct 7 ms 512 KB Output is correct
35 Correct 7 ms 512 KB Output is correct
36 Correct 7 ms 512 KB Output is correct
37 Correct 7 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 7 ms 512 KB Output is correct
40 Correct 7 ms 512 KB Output is correct
41 Correct 7 ms 512 KB Output is correct
42 Correct 7 ms 512 KB Output is correct
43 Correct 8 ms 512 KB Output is correct
44 Correct 7 ms 512 KB Output is correct
45 Correct 7 ms 512 KB Output is correct
46 Correct 7 ms 512 KB Output is correct
47 Correct 7 ms 512 KB Output is correct
48 Correct 7 ms 512 KB Output is correct
49 Correct 7 ms 512 KB Output is correct
50 Correct 7 ms 384 KB Output is correct
51 Correct 8 ms 512 KB Output is correct
52 Correct 293 ms 20756 KB Output is correct
53 Correct 283 ms 20828 KB Output is correct
54 Correct 286 ms 20984 KB Output is correct
55 Correct 285 ms 20864 KB Output is correct
56 Correct 279 ms 20856 KB Output is correct
57 Correct 286 ms 20880 KB Output is correct
58 Correct 284 ms 20924 KB Output is correct
59 Correct 300 ms 20728 KB Output is correct
60 Correct 282 ms 20856 KB Output is correct
61 Correct 281 ms 20600 KB Output is correct
62 Correct 282 ms 20856 KB Output is correct
63 Correct 288 ms 20856 KB Output is correct
64 Correct 298 ms 20856 KB Output is correct
65 Correct 283 ms 20936 KB Output is correct
66 Correct 291 ms 20760 KB Output is correct
67 Correct 286 ms 20728 KB Output is correct
68 Correct 278 ms 20836 KB Output is correct