oj.uz

Submission #875756

# Submission time Handle Problem Language Result Execution time Memory
875756 2023-11-20T12:40:37 Z Requiem Cake 3 (JOI19_cake3) C++17
100 / 100
 756 ms 238124 KB 
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define endl '\n'
#define pi 3.14159265359
#define TASKNAME "cake3"
#define all(a) a.begin(),a.end()
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
const int MAXN = 3e5 + 9;
int n,m,a[MAXN],ans=INF;
ii p[MAXN];
vector<int> listval;
vector<int> valpos[MAXN];
vector<int> pre[MAXN<<2];
vector<int> wavelet[MAXN<<2];
vector<int> bit[MAXN<<2];
int getval(int x){
    return lower_bound(all(listval),x) - listval.begin() + 1;
}
void merged(int node,int a,int b){
     int ptr1 = 0, ptr2 = 0, prebit = 0, presum = 0;
     bit[node].pb(0);
     pre[node].pb(0);
     while(ptr1 < wavelet[a].size() or ptr2 < wavelet[b].size()){
        if (ptr1 == wavelet[a].size()){
            wavelet[node].pb(wavelet[b][ptr2++]);
            bit[node].pb(prebit);
            presum = presum + p[wavelet[b][ptr2-1]].fi;
            pre[node].pb(presum);

        }
        else if (ptr2 == wavelet[b].size()){
            wavelet[node].pb(wavelet[a][ptr1++]);
            bit[node].pb(++prebit);
            presum = presum + p[wavelet[a][ptr1-1]].fi;
            pre[node].pb(presum);

        }
        else if (wavelet[a][ptr1] < wavelet[b][ptr2]){
            wavelet[node].pb(wavelet[a][ptr1++]);
            bit[node].pb(++prebit);
            presum = presum + p[wavelet[a][ptr1-1]].fi;
            pre[node].pb(presum);
        }
        else {
            wavelet[node].pb(wavelet[b][ptr2++]);
            bit[node].pb(prebit);
            presum = presum + p[wavelet[b][ptr2-1]].fi;
            pre[node].pb(presum);
        }
     }
}
void build(int node,int l,int r){
    if (l==r){
        int presum = 0;
        pre[node].pb(0);
        for(auto x: valpos[l]){
            presum += listval[l-1];
            wavelet[node].pb(x);
            pre[node].pb(presum);
        }
        return;
    }
    int mid = (l+r)>>1;
    build(node<<1,l,mid);
    build(node<<1|1,mid+1,r);
    int id1 = 0, id2 = 0;
    merged(node,node<<1,node<<1|1);
}
int getkth(int node,int l,int r,int u,int v,int k){
    if (l==r){
        return k * listval[l-1];
    }
    if (u>v) return 0;
    int mid = (l+r)>>1;
    int poslu = bit[node][u] + (bit[node][u] - bit[node][u-1] == 0);
    int poslv = bit[node][v];
    int posru = u - bit[node][u] + (bit[node][u] - bit[node][u-1] == 1);
    int posrv = v - bit[node][v];
//    cout<<l<<' '<<r<<' '<<poslu<<' '<<poslv<<' '<<posru<<' '<<posrv<<' '<<k<<endl;
    if (posrv - posru + 1 >= k) {
        return getkth(node<<1|1,mid+1,r,posru,posrv,k);
    }
    else{
//        cout<<"ADD:"<<pre[node<<1|1][posrv] - pre[node<<1|1][posru-1]<<endl;
        return pre[node<<1|1][posrv] - pre[node<<1|1][posru-1] + getkth(node<<1,l,mid,poslu,poslv,k-posrv+posru-1);
    }
}
int C(int l,int r){
    return getkth(1,1,sz(listval),l,r,m) - (p[r].se - p[l].se)*2;
}
int dp[MAXN];
void dnc(int l,int r,int optl,int optr){
    ii best = {-INF,-1};
    int mid = (l+r)>>1;
    if (l>r) return;
    for(int i=max(mid+m-1,optl);i<=optr;i++){
        best = max(best, ii(C(mid,i),i));
    }
    dp[mid] = best.fi;
    int opt = best.se;
    dnc(l,mid-1,optl,opt);
    dnc(mid+1,r,opt,optr);
}
main()
{
    fast;
    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>>p[i].fi>>p[i].se;
        listval.pb(p[i].fi);
    }
    sort(listval.begin(),listval.end());
    listval.erase(unique(all(listval)),listval.end());
    sort(p+1,p+1+n,[](const ii &a,const ii &b){
        return a.se < b.se;
    });
    ans=-INF;
    for(int i=1;i<=n;i++){
        int x = getval(p[i].fi);
        valpos[x].pb(i);
    }
    build(1,1,sz(listval));
    dnc(1,n-m+1,1,n);
    for(int i=1;i<=n-m+1;i++){
        maximize(ans, dp[i]);
    }
//    cout<<endl;
    cout<<ans<<endl;
}

Compilation message

cake3.cpp: In function 'void merged(long long int, long long int, long long int)':
cake3.cpp:37:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |      while(ptr1 < wavelet[a].size() or ptr2 < wavelet[b].size()){
      |            ~~~~~^~~~~~~~~~~~~~~~~~~
cake3.cpp:37:45: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |      while(ptr1 < wavelet[a].size() or ptr2 < wavelet[b].size()){
      |                                        ~~~~~^~~~~~~~~~~~~~~~~~~
cake3.cpp:38:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         if (ptr1 == wavelet[a].size()){
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~
cake3.cpp:45:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         else if (ptr2 == wavelet[b].size()){
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~
cake3.cpp: In function 'void build(long long int, long long int, long long int)':
cake3.cpp:80:9: warning: unused variable 'id1' [-Wunused-variable]
   80 |     int id1 = 0, id2 = 0;
      |         ^~~
cake3.cpp:80:18: warning: unused variable 'id2' [-Wunused-variable]
   80 |     int id1 = 0, id2 = 0;
      |                  ^~~
cake3.cpp: At global scope:
cake3.cpp:118:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  118 | main()
      | ^~~~
cake3.cpp: In function 'int main()':
cake3.cpp:122:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |         freopen(TASKNAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:123:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  123 |         freopen(TASKNAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 92760 KB Output is correct
2 Correct 20 ms 92764 KB Output is correct
3 Correct 20 ms 92764 KB Output is correct
4 Correct 21 ms 92716 KB Output is correct
5 Correct 20 ms 92760 KB Output is correct
6 Correct 22 ms 92764 KB Output is correct
7 Correct 22 ms 92764 KB Output is correct
8 Correct 20 ms 93016 KB Output is correct
9 Correct 21 ms 92764 KB Output is correct
10 Correct 23 ms 92836 KB Output is correct
11 Correct 21 ms 92764 KB Output is correct
12 Correct 21 ms 92724 KB Output is correct
13 Correct 21 ms 92764 KB Output is correct
14 Correct 20 ms 92764 KB Output is correct
15 Correct 20 ms 92764 KB Output is correct
16 Correct 22 ms 92764 KB Output is correct
17 Correct 22 ms 92764 KB Output is correct
18 Correct 20 ms 92740 KB Output is correct
19 Correct 20 ms 92680 KB Output is correct
20 Correct 20 ms 92724 KB Output is correct
21 Correct 21 ms 92764 KB Output is correct
22 Correct 22 ms 92668 KB Output is correct
23 Correct 21 ms 92764 KB Output is correct
24 Correct 20 ms 92764 KB Output is correct
25 Correct 20 ms 92760 KB Output is correct
26 Correct 21 ms 92764 KB Output is correct
27 Correct 21 ms 92764 KB Output is correct
28 Correct 21 ms 92764 KB Output is correct
29 Correct 21 ms 92760 KB Output is correct
30 Correct 21 ms 92712 KB Output is correct
31 Correct 20 ms 92760 KB Output is correct
32 Correct 21 ms 92764 KB Output is correct
33 Correct 21 ms 92764 KB Output is correct
34 Correct 20 ms 92764 KB Output is correct
35 Correct 20 ms 92764 KB Output is correct
36 Correct 22 ms 93020 KB Output is correct
37 Correct 21 ms 92752 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 92760 KB Output is correct
2 Correct 20 ms 92764 KB Output is correct
3 Correct 20 ms 92764 KB Output is correct
4 Correct 21 ms 92716 KB Output is correct
5 Correct 20 ms 92760 KB Output is correct
6 Correct 22 ms 92764 KB Output is correct
7 Correct 22 ms 92764 KB Output is correct
8 Correct 20 ms 93016 KB Output is correct
9 Correct 21 ms 92764 KB Output is correct
10 Correct 23 ms 92836 KB Output is correct
11 Correct 21 ms 92764 KB Output is correct
12 Correct 21 ms 92724 KB Output is correct
13 Correct 21 ms 92764 KB Output is correct
14 Correct 20 ms 92764 KB Output is correct
15 Correct 20 ms 92764 KB Output is correct
16 Correct 22 ms 92764 KB Output is correct
17 Correct 22 ms 92764 KB Output is correct
18 Correct 20 ms 92740 KB Output is correct
19 Correct 20 ms 92680 KB Output is correct
20 Correct 20 ms 92724 KB Output is correct
21 Correct 21 ms 92764 KB Output is correct
22 Correct 22 ms 92668 KB Output is correct
23 Correct 21 ms 92764 KB Output is correct
24 Correct 20 ms 92764 KB Output is correct
25 Correct 20 ms 92760 KB Output is correct
26 Correct 21 ms 92764 KB Output is correct
27 Correct 21 ms 92764 KB Output is correct
28 Correct 21 ms 92764 KB Output is correct
29 Correct 21 ms 92760 KB Output is correct
30 Correct 21 ms 92712 KB Output is correct
31 Correct 20 ms 92760 KB Output is correct
32 Correct 21 ms 92764 KB Output is correct
33 Correct 21 ms 92764 KB Output is correct
34 Correct 20 ms 92764 KB Output is correct
35 Correct 20 ms 92764 KB Output is correct
36 Correct 22 ms 93020 KB Output is correct
37 Correct 21 ms 92752 KB Output is correct
38 Correct 24 ms 93532 KB Output is correct
39 Correct 24 ms 93532 KB Output is correct
40 Correct 24 ms 93532 KB Output is correct
41 Correct 24 ms 93532 KB Output is correct
42 Correct 25 ms 93852 KB Output is correct
43 Correct 24 ms 93528 KB Output is correct
44 Correct 26 ms 93780 KB Output is correct
45 Correct 25 ms 93732 KB Output is correct
46 Correct 24 ms 93532 KB Output is correct
47 Correct 24 ms 93784 KB Output is correct
48 Correct 23 ms 93528 KB Output is correct
49 Correct 24 ms 93532 KB Output is correct
50 Correct 24 ms 93528 KB Output is correct
51 Correct 25 ms 93532 KB Output is correct
52 Correct 27 ms 93788 KB Output is correct
53 Correct 23 ms 93528 KB Output is correct
54 Correct 23 ms 93532 KB Output is correct
55 Correct 23 ms 93528 KB Output is correct
56 Correct 23 ms 93532 KB Output is correct
57 Correct 24 ms 93532 KB Output is correct
58 Correct 23 ms 93780 KB Output is correct
59 Correct 21 ms 92672 KB Output is correct
60 Correct 22 ms 92764 KB Output is correct
61 Correct 21 ms 92764 KB Output is correct
62 Correct 22 ms 92764 KB Output is correct
63 Correct 21 ms 92764 KB Output is correct
64 Correct 21 ms 92756 KB Output is correct
65 Correct 23 ms 93532 KB Output is correct
66 Correct 24 ms 93532 KB Output is correct
67 Correct 24 ms 93532 KB Output is correct
68 Correct 24 ms 93532 KB Output is correct
69 Correct 24 ms 93536 KB Output is correct
70 Correct 23 ms 93708 KB Output is correct
71 Correct 21 ms 92980 KB Output is correct
72 Correct 21 ms 93024 KB Output is correct
73 Correct 24 ms 93532 KB Output is correct
74 Correct 23 ms 93532 KB Output is correct

Subtask #3
76.0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 92760 KB Output is correct
2 Correct 20 ms 92764 KB Output is correct
3 Correct 20 ms 92764 KB Output is correct
4 Correct 21 ms 92716 KB Output is correct
5 Correct 20 ms 92760 KB Output is correct
6 Correct 22 ms 92764 KB Output is correct
7 Correct 22 ms 92764 KB Output is correct
8 Correct 20 ms 93016 KB Output is correct
9 Correct 21 ms 92764 KB Output is correct
10 Correct 23 ms 92836 KB Output is correct
11 Correct 21 ms 92764 KB Output is correct
12 Correct 21 ms 92724 KB Output is correct
13 Correct 21 ms 92764 KB Output is correct
14 Correct 20 ms 92764 KB Output is correct
15 Correct 20 ms 92764 KB Output is correct
16 Correct 22 ms 92764 KB Output is correct
17 Correct 22 ms 92764 KB Output is correct
18 Correct 20 ms 92740 KB Output is correct
19 Correct 20 ms 92680 KB Output is correct
20 Correct 20 ms 92724 KB Output is correct
21 Correct 21 ms 92764 KB Output is correct
22 Correct 22 ms 92668 KB Output is correct
23 Correct 21 ms 92764 KB Output is correct
24 Correct 20 ms 92764 KB Output is correct
25 Correct 20 ms 92760 KB Output is correct
26 Correct 21 ms 92764 KB Output is correct
27 Correct 21 ms 92764 KB Output is correct
28 Correct 21 ms 92764 KB Output is correct
29 Correct 21 ms 92760 KB Output is correct
30 Correct 21 ms 92712 KB Output is correct
31 Correct 20 ms 92760 KB Output is correct
32 Correct 21 ms 92764 KB Output is correct
33 Correct 21 ms 92764 KB Output is correct
34 Correct 20 ms 92764 KB Output is correct
35 Correct 20 ms 92764 KB Output is correct
36 Correct 22 ms 93020 KB Output is correct
37 Correct 21 ms 92752 KB Output is correct
38 Correct 24 ms 93532 KB Output is correct
39 Correct 24 ms 93532 KB Output is correct
40 Correct 24 ms 93532 KB Output is correct
41 Correct 24 ms 93532 KB Output is correct
42 Correct 25 ms 93852 KB Output is correct
43 Correct 24 ms 93528 KB Output is correct
44 Correct 26 ms 93780 KB Output is correct
45 Correct 25 ms 93732 KB Output is correct
46 Correct 24 ms 93532 KB Output is correct
47 Correct 24 ms 93784 KB Output is correct
48 Correct 23 ms 93528 KB Output is correct
49 Correct 24 ms 93532 KB Output is correct
50 Correct 24 ms 93528 KB Output is correct
51 Correct 25 ms 93532 KB Output is correct
52 Correct 27 ms 93788 KB Output is correct
53 Correct 23 ms 93528 KB Output is correct
54 Correct 23 ms 93532 KB Output is correct
55 Correct 23 ms 93528 KB Output is correct
56 Correct 23 ms 93532 KB Output is correct
57 Correct 24 ms 93532 KB Output is correct
58 Correct 23 ms 93780 KB Output is correct
59 Correct 21 ms 92672 KB Output is correct
60 Correct 22 ms 92764 KB Output is correct
61 Correct 21 ms 92764 KB Output is correct
62 Correct 22 ms 92764 KB Output is correct
63 Correct 21 ms 92764 KB Output is correct
64 Correct 21 ms 92756 KB Output is correct
65 Correct 23 ms 93532 KB Output is correct
66 Correct 24 ms 93532 KB Output is correct
67 Correct 24 ms 93532 KB Output is correct
68 Correct 24 ms 93532 KB Output is correct
69 Correct 24 ms 93536 KB Output is correct
70 Correct 23 ms 93708 KB Output is correct
71 Correct 21 ms 92980 KB Output is correct
72 Correct 21 ms 93024 KB Output is correct
73 Correct 24 ms 93532 KB Output is correct
74 Correct 23 ms 93532 KB Output is correct
75 Correct 712 ms 229700 KB Output is correct
76 Correct 756 ms 227520 KB Output is correct
77 Correct 647 ms 230472 KB Output is correct
78 Correct 681 ms 232472 KB Output is correct
79 Correct 424 ms 231768 KB Output is correct
80 Correct 423 ms 227864 KB Output is correct
81 Correct 335 ms 195596 KB Output is correct
82 Correct 481 ms 202312 KB Output is correct
83 Correct 383 ms 198728 KB Output is correct
84 Correct 390 ms 200136 KB Output is correct
85 Correct 365 ms 196072 KB Output is correct
86 Correct 240 ms 190084 KB Output is correct
87 Correct 271 ms 190784 KB Output is correct
88 Correct 308 ms 192976 KB Output is correct
89 Correct 337 ms 193352 KB Output is correct
90 Correct 246 ms 191808 KB Output is correct
91 Correct 202 ms 187464 KB Output is correct
92 Correct 208 ms 187068 KB Output is correct
93 Correct 253 ms 188992 KB Output is correct
94 Correct 200 ms 189508 KB Output is correct
95 Correct 240 ms 191380 KB Output is correct
96 Correct 66 ms 106788 KB Output is correct
97 Correct 71 ms 107352 KB Output is correct
98 Correct 75 ms 107152 KB Output is correct
99 Correct 70 ms 107176 KB Output is correct
100 Correct 71 ms 107040 KB Output is correct
101 Correct 64 ms 106828 KB Output is correct
102 Correct 241 ms 176052 KB Output is correct
103 Correct 225 ms 173056 KB Output is correct
104 Correct 261 ms 181228 KB Output is correct
105 Correct 202 ms 173880 KB Output is correct
106 Correct 203 ms 175072 KB Output is correct
107 Correct 183 ms 170664 KB Output is correct
108 Correct 658 ms 231672 KB Output is correct
109 Correct 606 ms 238124 KB Output is correct
110 Correct 87 ms 127080 KB Output is correct
111 Correct 94 ms 128896 KB Output is correct
112 Correct 679 ms 229720 KB Output is correct
113 Correct 445 ms 237200 KB Output is correct