oj.uz

Submission #253313

# Submission time Handle Problem Language Result Execution time Memory
253313 2020-07-27T16:57:12 Z Mercenary Cake 3 (JOI19_cake3) C++14
100 / 100
 1863 ms 13560 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int maxn = 2e5 + 5;

ll s[maxn * 4];
int cnt[maxn * 4];
ll res = -1e18;
int order[maxn] , id[maxn];
int n , m;
ii a[maxn];

void flip(int x , int l , int r , int pos){
    if(l == r){
        if(cnt[x] == 0)cnt[x] = 1 , s[x] = a[order[l]].second;
        else cnt[x] = 0 , s[x] = 0;
        return;
    }
    int mid = l + r >> 1;
    if(pos <= mid)flip(x * 2 , l , mid , pos);
    else flip(x * 2 + 1 , mid + 1 , r , pos);
    s[x] = s[x * 2] + s[x * 2 + 1];
    cnt[x] = cnt[x * 2] + cnt[x * 2 + 1];
}

ll get(int x , int l , int r , int k){
    if(cnt[x] <= k)return s[x];
    if(l == r || k <= 0)return 0;
    ll sum = 0;
    int mid = l + r >> 1;
    sum += get(x * 2 + 1 , mid + 1 , r , min(k , cnt[x * 2 + 1]));
    k -= min(k , cnt[x * 2 + 1]);
    sum += get(x * 2 , l , mid , k);
    return sum;
}

void flip(int pos){flip(1,1,n,pos);}
ll get(int k){return get(1,1,n,k);};

int L = 1 , R = 0;

void correct(int l , int r){
    while(L < l)flip(id[L++]);
    while(L > l)flip(id[--L]);
    while(R < r)flip(id[++R]);
    while(R > r)flip(id[R--]);
}

void solve(int l , int r , int bl , int br){
    if(l > r)return;
    int mid = l + r >> 1;
    pair<ll,int> b = mp(-1e18,mid);
    for(int i = bl ; i + m - 1 <= mid && i <= br ; ++i){
        correct(i , mid);
        b = max(b , mp(get(1,1,n,m) - (a[mid].first - a[i].first) * 2 , i));
    }
    res = max(res , b.first);
    solve(l , mid - 1 , bl , b.second);
    solve(mid + 1 , r , b.second , br);
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n >> m;
    for(int i = 1 ; i <= n ; ++i){
        cin >> a[i].second >> a[i].first;
    }
    sort(a + 1 , a + n + 1);
    iota(order + 1 , order + n + 1 , 1);
    sort(order + 1 , order + n + 1 , [&](const int x , const int y){
        return a[x].second < a[y].second;
         });
    for(int i = 1 ; i <= n ; ++i){
        id[order[i]] = i;
    }
//    for(int i = 1 ; i <= n ; ++i)cout << id[i] << " ";
    solve(m , n , 1 , n);
    cout << res;
}

Compilation message

cake3.cpp: In function 'void flip(int, int, int, int)':
cake3.cpp:31:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
cake3.cpp: In function 'll get(int, int, int, int)':
cake3.cpp:42:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
cake3.cpp: In function 'void solve(int, int, int, int)':
cake3.cpp:63:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
cake3.cpp: In function 'int main()':
cake3.cpp:79:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:80:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

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

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 6 ms 512 KB Output is correct
39 Correct 6 ms 512 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 5 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 5 ms 512 KB Output is correct
46 Correct 6 ms 512 KB Output is correct
47 Correct 6 ms 512 KB Output is correct
48 Correct 5 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 4 ms 512 KB Output is correct
52 Correct 4 ms 512 KB Output is correct
53 Correct 4 ms 512 KB Output is correct
54 Correct 3 ms 512 KB Output is correct
55 Correct 3 ms 512 KB Output is correct
56 Correct 2 ms 512 KB Output is correct
57 Correct 3 ms 512 KB Output is correct
58 Correct 2 ms 512 KB Output is correct
59 Correct 3 ms 512 KB Output is correct
60 Correct 4 ms 512 KB Output is correct
61 Correct 3 ms 512 KB Output is correct
62 Correct 3 ms 512 KB Output is correct
63 Correct 3 ms 512 KB Output is correct
64 Correct 3 ms 512 KB Output is correct
65 Correct 5 ms 512 KB Output is correct
66 Correct 4 ms 512 KB Output is correct
67 Correct 5 ms 512 KB Output is correct
68 Correct 4 ms 512 KB Output is correct
69 Correct 4 ms 512 KB Output is correct
70 Correct 4 ms 512 KB Output is correct
71 Correct 4 ms 512 KB Output is correct
72 Correct 2 ms 512 KB Output is correct
73 Correct 3 ms 512 KB Output is correct
74 Correct 1 ms 512 KB Output is correct
75 Correct 1440 ms 13124 KB Output is correct
76 Correct 1863 ms 12924 KB Output is correct
77 Correct 1229 ms 13176 KB Output is correct
78 Correct 1405 ms 13304 KB Output is correct
79 Correct 148 ms 13304 KB Output is correct
80 Correct 240 ms 13048 KB Output is correct
81 Correct 1241 ms 12408 KB Output is correct
82 Correct 1603 ms 12536 KB Output is correct
83 Correct 1494 ms 12792 KB Output is correct
84 Correct 1659 ms 12648 KB Output is correct
85 Correct 1315 ms 12536 KB Output is correct
86 Correct 652 ms 12284 KB Output is correct
87 Correct 680 ms 12152 KB Output is correct
88 Correct 1119 ms 12024 KB Output is correct
89 Correct 1032 ms 12540 KB Output is correct
90 Correct 706 ms 12664 KB Output is correct
91 Correct 411 ms 12152 KB Output is correct
92 Correct 468 ms 12280 KB Output is correct
93 Correct 532 ms 12280 KB Output is correct
94 Correct 368 ms 12604 KB Output is correct
95 Correct 675 ms 12664 KB Output is correct
96 Correct 515 ms 12152 KB Output is correct
97 Correct 573 ms 12664 KB Output is correct
98 Correct 606 ms 12664 KB Output is correct
99 Correct 538 ms 12536 KB Output is correct
100 Correct 412 ms 12252 KB Output is correct
101 Correct 448 ms 12152 KB Output is correct
102 Correct 1199 ms 12408 KB Output is correct
103 Correct 1112 ms 12280 KB Output is correct
104 Correct 1357 ms 12536 KB Output is correct
105 Correct 914 ms 12408 KB Output is correct
106 Correct 992 ms 12664 KB Output is correct
107 Correct 808 ms 12408 KB Output is correct
108 Correct 1171 ms 13048 KB Output is correct
109 Correct 919 ms 13368 KB Output is correct
110 Correct 523 ms 11768 KB Output is correct
111 Correct 775 ms 11740 KB Output is correct
112 Correct 511 ms 11384 KB Output is correct
113 Correct 145 ms 13560 KB Output is correct