oj.uz

답안 #362781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362781 2021-02-04T11:20:10 Z Dymo Cake 3 (JOI19_cake3) C++14
100 / 100
 2856 ms 21984 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
const ll maxn =2e5+10;
const ll mod=1e9+7;
const ll base=1e18;


ll st[4*maxn];
ll st1[4*maxn];
ll val[maxn];
ll pos[maxn];
pll a[maxn];



struct tk
{
    ll n;
    ll l=1;
    ll r=0;
    void update(ll id,ll left,ll right,ll x,ll diff)
    {
        if (x>right||x<left)
            return ;
        if (left==right)
        {
            st[id]+=diff;
            st1[id]+=val[left]*diff;
            return ;
        }
        ll mid=(left+right)/2;
        update(id*2,left,mid, x, diff);
        update(id*2+1,mid+1, right, x, diff);
        st[id]=st[id*2]+st[id*2+1];
        st1[id]=st1[id*2]+st1[id*2+1];
    }
    void finit(ll n1)
    {
        l=1;
        r=0;
        init(1,1,n1);
        n=n1;
    }
    void init(ll id,ll left,ll right)
    {
        st[id]=0;
        st1[id]=0;
        if (left==right)
            return  ;
        ll mid=(left+right)/2;
        init(id*2,left,mid);
        init(id*2+1,mid+1, right);
    }
    void ers(ll t)
    {
        update(1,1,n,t,-1);
    }
    void add(ll t)
    {
        update(1,1,n,t,1);
    }
    ll get1(ll lf,ll rt,ll x)
    {
        if (x<0) return -base;
        while (l>lf)
        {
            l--;
            add(pos[l]);
        }
        while (l<lf)
        {
            ers(pos[l]);
            l++;
        }
        while (r<rt)
        {
            r++;
            add(pos[r]);
        }
        while (r>rt)
        {
            ers(pos[r]);
            r--;
        }
        if (x>st[1])
        {
            return st1[1];
        }
        return get(1,1,n,x);
    }
    ll get(ll id,ll left,ll right,ll x)
    {
        if (left==right)
        {
            return val[left]*x;
        }
        ll mid=(left+right)/2;
        if (st[id*2+1]<x)
        {
            return get(id*2,left,mid,x-st[id*2+1])+st1[id*2+1];
        }
        else
        {
            return get(id*2+1,mid+1,right,x);
        }
    }
} man;
ll ans[maxn];
void dac(ll l,ll r,ll low,ll high,ll d)
{
   if (l>r) return ;
   ll mid=(l+r)/2;
   ll pos_best=-1;
   for (int i=low;i<=min(mid,min(mid-d+1,high));i++)
   {
       ll t=man.get1(i,mid,d)-2*(a[mid].ff-a[i].ff);
       if (ans[mid]<t)
       {
           ans[mid]=t;
           pos_best=i;
       }
   }
   dac(l,mid-1,low,pos_best,d);
   dac(mid+1,r,pos_best,high,d);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("t.inp","r"))
    {
        freopen("test.inp","r",stdin);
        freopen("test.out","w",stdout);
    }
    /*5 5
2 1
4 2
6 4
8 8
10 120*/
    ll n,m;
    cin>> n>> m;
    vector<ll> vt;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i].ss>>a[i].ff;
        vt.pb(a[i].ss);
    }
    sort(a+1,a+n+1);
    sort(vt.begin(),vt.end());
    vt.resize(unique(vt.begin(),vt.end())-vt.begin());
    for (int i=1;i<=n;i++)
    {
        pos[i]=lower_bound(vt.begin(),vt.end(),a[i].ss)-vt.begin()+1;
    }
    ll siz=vt.size();
    for (int i=1;i<=siz;i++)
    {
        val[i]=vt[i-1];
    }
    man.finit(siz);
    for (int i=1;i<=n;i++)
    {
        ans[i]=-base;
    }
    dac(m,n,1,n,m);
    ll res=-base;
    for (int i=1;i<=n;i++)
    {
        res=max(res,ans[i]);
    }
    cout <<res;


}

Compilation message

cake3.cpp: In function 'int main()':
cake3.cpp:142:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  142 |         freopen("test.inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
cake3.cpp:143:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  143 |         freopen("test.out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 396 KB Output is correct
35 Correct 40 ms 364 KB Output is correct
36 Correct 32 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 9 ms 620 KB Output is correct
39 Correct 7 ms 620 KB Output is correct
40 Correct 44 ms 620 KB Output is correct
41 Correct 5 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 4 ms 620 KB Output is correct
44 Correct 6 ms 620 KB Output is correct
45 Correct 7 ms 620 KB Output is correct
46 Correct 109 ms 724 KB Output is correct
47 Correct 7 ms 804 KB Output is correct
48 Correct 6 ms 620 KB Output is correct
49 Correct 78 ms 620 KB Output is correct
50 Correct 6 ms 620 KB Output is correct
51 Correct 5 ms 620 KB Output is correct
52 Correct 5 ms 620 KB Output is correct
53 Correct 5 ms 620 KB Output is correct
54 Correct 4 ms 648 KB Output is correct
55 Correct 41 ms 620 KB Output is correct
56 Correct 4 ms 648 KB Output is correct
57 Correct 5 ms 620 KB Output is correct
58 Correct 3 ms 620 KB Output is correct
59 Correct 1 ms 492 KB Output is correct
60 Correct 41 ms 492 KB Output is correct
61 Correct 2 ms 492 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 77 ms 492 KB Output is correct
64 Correct 2 ms 492 KB Output is correct
65 Correct 6 ms 620 KB Output is correct
66 Correct 5 ms 620 KB Output is correct
67 Correct 8 ms 620 KB Output is correct
68 Correct 5 ms 620 KB Output is correct
69 Correct 5 ms 620 KB Output is correct
70 Correct 5 ms 620 KB Output is correct
71 Correct 2 ms 492 KB Output is correct
72 Correct 2 ms 492 KB Output is correct
73 Correct 7 ms 620 KB Output is correct
74 Correct 74 ms 620 KB Output is correct

Subtask #3
76.0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 396 KB Output is correct
35 Correct 40 ms 364 KB Output is correct
36 Correct 32 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 9 ms 620 KB Output is correct
39 Correct 7 ms 620 KB Output is correct
40 Correct 44 ms 620 KB Output is correct
41 Correct 5 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 4 ms 620 KB Output is correct
44 Correct 6 ms 620 KB Output is correct
45 Correct 7 ms 620 KB Output is correct
46 Correct 109 ms 724 KB Output is correct
47 Correct 7 ms 804 KB Output is correct
48 Correct 6 ms 620 KB Output is correct
49 Correct 78 ms 620 KB Output is correct
50 Correct 6 ms 620 KB Output is correct
51 Correct 5 ms 620 KB Output is correct
52 Correct 5 ms 620 KB Output is correct
53 Correct 5 ms 620 KB Output is correct
54 Correct 4 ms 648 KB Output is correct
55 Correct 41 ms 620 KB Output is correct
56 Correct 4 ms 648 KB Output is correct
57 Correct 5 ms 620 KB Output is correct
58 Correct 3 ms 620 KB Output is correct
59 Correct 1 ms 492 KB Output is correct
60 Correct 41 ms 492 KB Output is correct
61 Correct 2 ms 492 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 77 ms 492 KB Output is correct
64 Correct 2 ms 492 KB Output is correct
65 Correct 6 ms 620 KB Output is correct
66 Correct 5 ms 620 KB Output is correct
67 Correct 8 ms 620 KB Output is correct
68 Correct 5 ms 620 KB Output is correct
69 Correct 5 ms 620 KB Output is correct
70 Correct 5 ms 620 KB Output is correct
71 Correct 2 ms 492 KB Output is correct
72 Correct 2 ms 492 KB Output is correct
73 Correct 7 ms 620 KB Output is correct
74 Correct 74 ms 620 KB Output is correct
75 Correct 2628 ms 21016 KB Output is correct
76 Correct 2856 ms 20724 KB Output is correct
77 Correct 1991 ms 21108 KB Output is correct
78 Correct 2197 ms 21216 KB Output is correct
79 Correct 219 ms 21360 KB Output is correct
80 Correct 378 ms 21088 KB Output is correct
81 Correct 1219 ms 12000 KB Output is correct
82 Correct 1810 ms 13408 KB Output is correct
83 Correct 1470 ms 12532 KB Output is correct
84 Correct 1590 ms 13536 KB Output is correct
85 Correct 1268 ms 12212 KB Output is correct
86 Correct 629 ms 11616 KB Output is correct
87 Correct 665 ms 11512 KB Output is correct
88 Correct 1151 ms 11488 KB Output is correct
89 Correct 1022 ms 12020 KB Output is correct
90 Correct 637 ms 12384 KB Output is correct
91 Correct 389 ms 11232 KB Output is correct
92 Correct 441 ms 10976 KB Output is correct
93 Correct 503 ms 11360 KB Output is correct
94 Correct 322 ms 11744 KB Output is correct
95 Correct 590 ms 12424 KB Output is correct
96 Correct 87 ms 10464 KB Output is correct
97 Correct 95 ms 11232 KB Output is correct
98 Correct 96 ms 11252 KB Output is correct
99 Correct 105 ms 11104 KB Output is correct
100 Correct 84 ms 10464 KB Output is correct
101 Correct 105 ms 10464 KB Output is correct
102 Correct 799 ms 10812 KB Output is correct
103 Correct 769 ms 10592 KB Output is correct
104 Correct 898 ms 11232 KB Output is correct
105 Correct 614 ms 10976 KB Output is correct
106 Correct 635 ms 11360 KB Output is correct
107 Correct 527 ms 10976 KB Output is correct
108 Correct 1918 ms 21088 KB Output is correct
109 Correct 1462 ms 21728 KB Output is correct
110 Correct 132 ms 9952 KB Output is correct
111 Correct 207 ms 10080 KB Output is correct
112 Correct 1126 ms 19296 KB Output is correct
113 Correct 212 ms 21984 KB Output is correct