oj.uz

Submission #573992

# Submission time Handle Problem Language Result Execution time Memory
573992 2022-06-07T14:30:08 Z YouAreMyGalaxy Cake 3 (JOI19_cake3) C++17
24 / 100
 4000 ms 6628 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 2e5;
int id[N + 1], a[N + 1], b[N + 1];
int n, m;
long long res = -1e18;
void read()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i] >> b[i];
        id[i] = i;
    }
    sort(id + 1, id + n + 1, [&](const int &x, const int &y)
         {
             return b[x] < b[y];
         });
}
void solve()
{
    for (int i = 1; i <= n; ++ i)
    {
        priority_queue<int, vector<int>, greater<int> > PQ;
        long long sum = 0;
        int l = id[i];
        for (int j = i; j <= n; ++ j)
        {
            int r = id[j];
            sum += a[r];
            PQ.push(a[r]);
            if (PQ.size() > m)
            {
                sum -= PQ.top();
                PQ.pop();
            }
            if (PQ.size() == m)
            {
                res = max(res, sum - 2 * (b[r] - b[l]));
            }
        }
    }
    cout << res;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case #" << __ << ":" << '\n';
        read();
        solve();
    }
}

Compilation message

cake3.cpp: In function 'void solve()':
cake3.cpp:36:27: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |             if (PQ.size() > m)
      |                 ~~~~~~~~~~^~~
cake3.cpp:41:27: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |             if (PQ.size() == m)
      |                 ~~~~~~~~~~^~~~
cake3.cpp: In function 'int main()':
cake3.cpp:55:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 68 ms 376 KB Output is correct
39 Correct 71 ms 388 KB Output is correct
40 Correct 50 ms 460 KB Output is correct
41 Correct 50 ms 380 KB Output is correct
42 Correct 38 ms 340 KB Output is correct
43 Correct 40 ms 388 KB Output is correct
44 Correct 58 ms 340 KB Output is correct
45 Correct 69 ms 380 KB Output is correct
46 Correct 77 ms 380 KB Output is correct
47 Correct 70 ms 340 KB Output is correct
48 Correct 61 ms 340 KB Output is correct
49 Correct 61 ms 384 KB Output is correct
50 Correct 61 ms 340 KB Output is correct
51 Correct 58 ms 380 KB Output is correct
52 Correct 52 ms 376 KB Output is correct
53 Correct 56 ms 380 KB Output is correct
54 Correct 46 ms 340 KB Output is correct
55 Correct 41 ms 400 KB Output is correct
56 Correct 36 ms 340 KB Output is correct
57 Correct 39 ms 392 KB Output is correct
58 Correct 38 ms 384 KB Output is correct
59 Correct 17 ms 340 KB Output is correct
60 Correct 22 ms 336 KB Output is correct
61 Correct 19 ms 344 KB Output is correct
62 Correct 16 ms 412 KB Output is correct
63 Correct 23 ms 396 KB Output is correct
64 Correct 17 ms 404 KB Output is correct
65 Correct 61 ms 372 KB Output is correct
66 Correct 56 ms 340 KB Output is correct
67 Correct 66 ms 392 KB Output is correct
68 Correct 54 ms 344 KB Output is correct
69 Correct 46 ms 340 KB Output is correct
70 Correct 48 ms 388 KB Output is correct
71 Correct 67 ms 364 KB Output is correct
72 Correct 47 ms 340 KB Output is correct
73 Correct 66 ms 372 KB Output is correct
74 Correct 36 ms 340 KB Output is correct

Subtask #3
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 68 ms 376 KB Output is correct
39 Correct 71 ms 388 KB Output is correct
40 Correct 50 ms 460 KB Output is correct
41 Correct 50 ms 380 KB Output is correct
42 Correct 38 ms 340 KB Output is correct
43 Correct 40 ms 388 KB Output is correct
44 Correct 58 ms 340 KB Output is correct
45 Correct 69 ms 380 KB Output is correct
46 Correct 77 ms 380 KB Output is correct
47 Correct 70 ms 340 KB Output is correct
48 Correct 61 ms 340 KB Output is correct
49 Correct 61 ms 384 KB Output is correct
50 Correct 61 ms 340 KB Output is correct
51 Correct 58 ms 380 KB Output is correct
52 Correct 52 ms 376 KB Output is correct
53 Correct 56 ms 380 KB Output is correct
54 Correct 46 ms 340 KB Output is correct
55 Correct 41 ms 400 KB Output is correct
56 Correct 36 ms 340 KB Output is correct
57 Correct 39 ms 392 KB Output is correct
58 Correct 38 ms 384 KB Output is correct
59 Correct 17 ms 340 KB Output is correct
60 Correct 22 ms 336 KB Output is correct
61 Correct 19 ms 344 KB Output is correct
62 Correct 16 ms 412 KB Output is correct
63 Correct 23 ms 396 KB Output is correct
64 Correct 17 ms 404 KB Output is correct
65 Correct 61 ms 372 KB Output is correct
66 Correct 56 ms 340 KB Output is correct
67 Correct 66 ms 392 KB Output is correct
68 Correct 54 ms 344 KB Output is correct
69 Correct 46 ms 340 KB Output is correct
70 Correct 48 ms 388 KB Output is correct
71 Correct 67 ms 364 KB Output is correct
72 Correct 47 ms 340 KB Output is correct
73 Correct 66 ms 372 KB Output is correct
74 Correct 36 ms 340 KB Output is correct
75 Execution timed out 4083 ms 6628 KB Time limit exceeded
76 Halted 0 ms 0 KB -