oj.uz

답안 #493647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
493647 2021-12-12T13:28:05 Z blue Cake 3 (JOI19_cake3) C++17
100 / 100
 3250 ms 16616 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
 
struct piece
{
    long long V;
    long long C;
};
 
bool operator < (piece A, piece B)
{
    return A.C < B.C;
}
 
long long res = -1'000'000'000'000'000'000LL;
 
int N, M;
vector<piece> P;
 
int L;
int R; //exclusive endpoints
multiset<long long> high_values;
multiset<long long> low_values;
long long high_values_sum;
 
void insert_to_set(long long insert_value)
{
    high_values.insert(insert_value);
    high_values_sum += insert_value;
 
    if(high_values.size() > M-2)
    {
        high_values_sum -= *high_values.begin();
        low_values.insert(*high_values.begin());
        high_values.erase(high_values.find(*high_values.begin()));
    }
}
 
void expand_left()
{
    L--;
    insert_to_set(P[L+1].V);
}
 
void expand_right()
{
    R++;
    insert_to_set(P[R-1].V);
}
 
void contract_left()
{
    long long remove_value = P[L+1].V;
    L++;
    if(low_values.find(remove_value) != low_values.end())
    {
        low_values.erase(low_values.find(remove_value));
    }
    else
    {
        high_values.erase(high_values.find(remove_value));
        high_values_sum -= remove_value;
 
        if(high_values.size() < M-2 && low_values.size() >= 1)
        {
            high_values_sum += *low_values.rbegin();
            high_values.insert(*low_values.rbegin());
            low_values.erase(low_values.find(*low_values.rbegin()));
        }
    }
}
 
void contract_right()
{
    // cerr << "contract right\n";
    // cerr << "original R = " << R << '\n';
    long long remove_value = P[R-1].V;
    R--;
    if(low_values.find(remove_value) != low_values.end())
    {
        // cerr << "case 1 entered\n";
        low_values.erase(low_values.find(remove_value));
        // cerr << "case 1 successful\n";
    }
    else
    {
        // cerr << "case 2 entered\n";
        // cerr << remove_value << '\n';
        // for(long long h: high_values) cerr << h << ' ';
        // cerr << '\n';
        high_values.erase(high_values.find(remove_value));
        high_values_sum -= remove_value;
        // cerr << "X\n";
 
        if(high_values.size() < M-2 && low_values.size() >= 1)
        {
            high_values_sum += *low_values.rbegin();
            high_values.insert(*low_values.rbegin());
            low_values.erase(low_values.find(*low_values.rbegin()));
        }
        // cerr << "case 2 successful\n";
    }
}
 
 
 
long long get_curr_score()
{
    // cerr << "\n\n";
    // cerr << L << ' ' << R << ' ' << ' ' << P[L].V + high_values_sum + P[R].V  -  2*(P[R].C - P[L].C) << '\n';
    // cerr << P[L].V << ' ' << P[R].V << ' ' << P[L].C << ' ' << P[R].C << '\n';
    // cerr << "H: ";
    // for(long long h: high_values) cerr << h << ' ';
    // cerr << "\n";
    return P[L].V + high_values_sum + P[R].V  -  2*(P[R].C - P[L].C);
}
 
 
void solve(int l1, int l2, int r1, int r2)
{
    int l = (l1+l2)/2;
 
    // cerr << "\n\n\n";
    // cerr << "solve " << l1 << ' ' << l2 << ' ' << r1 << ' ' << r2 << '\n';
    // cerr << "l = " << l << '\n';
 
    while(l < L)
        expand_left();
 
    // cerr << "A\n";
 
    while(R < max(r1, l+M-1))
        expand_right();
// cerr << "B\n";
    while(L < l)
        contract_left();
// cerr << "C\n";
    // cerr << r1 << ' ' << l << ' ' << M << ' ' << l+M-1 << ' ' << R << '\n';
    while(max(r1, l+M-1) < R)
        contract_right();
 
    // cerr << "D\n";
 
    // cerr << "L, R = " << L << ' ' << R << '\n';
 
    int bestR = R;
    long long best_score = get_curr_score();
 
    while(R+1 <= r2)
    {
        // cerr << "! ";
        // cerr << R << ' ' << r2 << '\n';
        expand_right();
        if(get_curr_score() > best_score)
        {
            best_score = get_curr_score();
            bestR = R;
        }
    }
 
    // cerr << l << ' ' << bestR << ' ' << best_score << '\n';
 
    res = max(res, best_score);
    if(l1 <= l-1)
        solve(l1, l-1, r1, bestR);
    if(l+1 <= l2)
        solve(l+1, l2, bestR, r2);
}
 
int main()
{ ios_base::sync_with_stdio(false);cin.tie(NULL);
  
    cin >> N >> M;
    P = vector<piece>(N);
    for(int i = 0; i < N; i++) cin >> P[i].V >> P[i].C;
    sort(P.begin(), P.end());
 
    L = 0;
    R = 1;
 
    solve(0, N-M, M-1, N-1);
 
    cout << res << '\n';
}

Compilation message

cake3.cpp: In function 'void insert_to_set(long long int)':
cake3.cpp:34:27: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |     if(high_values.size() > M-2)
      |        ~~~~~~~~~~~~~~~~~~~^~~~~
cake3.cpp: In function 'void contract_left()':
cake3.cpp:67:31: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   67 |         if(high_values.size() < M-2 && low_values.size() >= 1)
      |            ~~~~~~~~~~~~~~~~~~~^~~~~
cake3.cpp: In function 'void contract_right()':
cake3.cpp:98:31: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   98 |         if(high_values.size() < M-2 && low_values.size() >= 1)
      |            ~~~~~~~~~~~~~~~~~~~^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 404 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 404 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 7 ms 464 KB Output is correct
39 Correct 7 ms 476 KB Output is correct
40 Correct 7 ms 476 KB Output is correct
41 Correct 5 ms 464 KB Output is correct
42 Correct 4 ms 464 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 6 ms 336 KB Output is correct
45 Correct 8 ms 336 KB Output is correct
46 Correct 8 ms 468 KB Output is correct
47 Correct 8 ms 336 KB Output is correct
48 Correct 8 ms 444 KB Output is correct
49 Correct 6 ms 464 KB Output is correct
50 Correct 6 ms 456 KB Output is correct
51 Correct 7 ms 464 KB Output is correct
52 Correct 7 ms 336 KB Output is correct
53 Correct 5 ms 336 KB Output is correct
54 Correct 4 ms 464 KB Output is correct
55 Correct 4 ms 456 KB Output is correct
56 Correct 3 ms 336 KB Output is correct
57 Correct 3 ms 336 KB Output is correct
58 Correct 3 ms 464 KB Output is correct
59 Correct 3 ms 336 KB Output is correct
60 Correct 6 ms 376 KB Output is correct
61 Correct 4 ms 336 KB Output is correct
62 Correct 3 ms 464 KB Output is correct
63 Correct 4 ms 464 KB Output is correct
64 Correct 3 ms 336 KB Output is correct
65 Correct 8 ms 336 KB Output is correct
66 Correct 7 ms 336 KB Output is correct
67 Correct 8 ms 460 KB Output is correct
68 Correct 7 ms 464 KB Output is correct
69 Correct 6 ms 336 KB Output is correct
70 Correct 6 ms 336 KB Output is correct
71 Correct 7 ms 336 KB Output is correct
72 Correct 4 ms 336 KB Output is correct
73 Correct 7 ms 464 KB Output is correct
74 Correct 1 ms 464 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 404 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 208 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 1 ms 208 KB Output is correct
37 Correct 1 ms 208 KB Output is correct
38 Correct 7 ms 464 KB Output is correct
39 Correct 7 ms 476 KB Output is correct
40 Correct 7 ms 476 KB Output is correct
41 Correct 5 ms 464 KB Output is correct
42 Correct 4 ms 464 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 6 ms 336 KB Output is correct
45 Correct 8 ms 336 KB Output is correct
46 Correct 8 ms 468 KB Output is correct
47 Correct 8 ms 336 KB Output is correct
48 Correct 8 ms 444 KB Output is correct
49 Correct 6 ms 464 KB Output is correct
50 Correct 6 ms 456 KB Output is correct
51 Correct 7 ms 464 KB Output is correct
52 Correct 7 ms 336 KB Output is correct
53 Correct 5 ms 336 KB Output is correct
54 Correct 4 ms 464 KB Output is correct
55 Correct 4 ms 456 KB Output is correct
56 Correct 3 ms 336 KB Output is correct
57 Correct 3 ms 336 KB Output is correct
58 Correct 3 ms 464 KB Output is correct
59 Correct 3 ms 336 KB Output is correct
60 Correct 6 ms 376 KB Output is correct
61 Correct 4 ms 336 KB Output is correct
62 Correct 3 ms 464 KB Output is correct
63 Correct 4 ms 464 KB Output is correct
64 Correct 3 ms 336 KB Output is correct
65 Correct 8 ms 336 KB Output is correct
66 Correct 7 ms 336 KB Output is correct
67 Correct 8 ms 460 KB Output is correct
68 Correct 7 ms 464 KB Output is correct
69 Correct 6 ms 336 KB Output is correct
70 Correct 6 ms 336 KB Output is correct
71 Correct 7 ms 336 KB Output is correct
72 Correct 4 ms 336 KB Output is correct
73 Correct 7 ms 464 KB Output is correct
74 Correct 1 ms 464 KB Output is correct
75 Correct 2991 ms 15676 KB Output is correct
76 Correct 3250 ms 15276 KB Output is correct
77 Correct 2547 ms 15672 KB Output is correct
78 Correct 2616 ms 15936 KB Output is correct
79 Correct 119 ms 15828 KB Output is correct
80 Correct 319 ms 15356 KB Output is correct
81 Correct 2580 ms 13544 KB Output is correct
82 Correct 2813 ms 13436 KB Output is correct
83 Correct 3052 ms 13960 KB Output is correct
84 Correct 3023 ms 14072 KB Output is correct
85 Correct 2777 ms 13640 KB Output is correct
86 Correct 1570 ms 13544 KB Output is correct
87 Correct 1699 ms 13368 KB Output is correct
88 Correct 2273 ms 12976 KB Output is correct
89 Correct 2117 ms 13892 KB Output is correct
90 Correct 1615 ms 14644 KB Output is correct
91 Correct 968 ms 13980 KB Output is correct
92 Correct 1026 ms 13824 KB Output is correct
93 Correct 1287 ms 14280 KB Output is correct
94 Correct 870 ms 15196 KB Output is correct
95 Correct 1612 ms 14804 KB Output is correct
96 Correct 759 ms 13092 KB Output is correct
97 Correct 799 ms 14168 KB Output is correct
98 Correct 846 ms 13872 KB Output is correct
99 Correct 752 ms 14152 KB Output is correct
100 Correct 569 ms 13572 KB Output is correct
101 Correct 604 ms 13464 KB Output is correct
102 Correct 2306 ms 13068 KB Output is correct
103 Correct 2167 ms 12872 KB Output is correct
104 Correct 2379 ms 13512 KB Output is correct
105 Correct 2094 ms 13828 KB Output is correct
106 Correct 2019 ms 14280 KB Output is correct
107 Correct 1751 ms 13916 KB Output is correct
108 Correct 2492 ms 15924 KB Output is correct
109 Correct 1881 ms 16544 KB Output is correct
110 Correct 1268 ms 13128 KB Output is correct
111 Correct 1856 ms 12612 KB Output is correct
112 Correct 2557 ms 13820 KB Output is correct
113 Correct 140 ms 16616 KB Output is correct