oj.uz

Submission #826016

# Submission time Handle Problem Language Result Execution time Memory
826016 2023-08-15T09:54:03 Z vnm06 Wiring (IOI17_wiring) C++14
100 / 100
 131 ms 15292 KB 
#include<bits/stdc++.h>
#include "wiring.h"
using namespace std;

struct point
{
    int ty;
    long long pos;
    point() {}
    point(int a, long long b)
    {
        ty=a;
        pos=b;
    }
};

bool cmp(point p, point q)
{
    return p.pos<q.pos;
}

int n;
point t[200005];
long long ans[200005];
long long sp[200005];
long long pref[200005];
long long ri_r[200005], ri_b[200005];

long long val[200005];
int id[800005];

void update(int v, int le, int ri, int pos, long long st)
{
    if(ri<pos || le>pos) return;
    if(le==ri)
    {
        val[le]=st;
        id[v]=le;
    }
    else
    {
        int mid=(le+ri)/2;
        update(2*v, le, mid, pos, st);
        update(2*v+1, mid+1, ri, pos, st);
        if(val[id[2*v]]<val[id[2*v+1]]) id[v]=id[2*v];
        else id[v]=id[2*v+1];
    }
}

int query(int v, int le, int ri, int be, int en)
{
    if(ri<be || le>en) return -1;
    if(be<=le && ri<=en) return id[v];
    else
    {
        int mid=(le+ri)/2;
        int id1=query(2*v, le, mid, be, en);
        int id2=query(2*v+1, mid+1, ri, be, en);
        if(id1==-1) return id2;
        if(id2==-1) return id1;
        if(val[id1]<val[id2]) return id1;
        return id2;
    }

}

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    n=r.size()+b.size();
    for(int i=0; i<r.size(); i++) t[i+1]=point(1, r[i]);
    for(int i=0; i<b.size(); i++) t[i+r.size()+1]=point(0, b[i]);
    sort(t+1, t+n+1, cmp);
    int idb=n+1, idr=n+1;
    for(int i=1; i<=n; i++) pref[i]=pref[i-1]+t[i].pos;
    for(int i=n; i>=1; i--)
    {
        int ty=t[i].ty;
        if(ty==1)
        {
            if(idb==n+1) sp[i]=0;
            else sp[i]=t[idb].pos-t[i].pos;
            idr=i;
        }
        else
        {
            if(idr==n+1) sp[i]=0;
            else sp[i]=t[idr].pos-t[i].pos;
            idb=i;
        }
    }
    for(int i=1; i<=n; i++) sp[i]+=sp[i-1];
    for(int i=1; i<=n; i++) update(1, 0, n+2, i, 1e18);
    update(1, 0, n+2, 0, 0);
    update(1, 0, n+2, 1, 1e18);
    ans[1]=1e18;
    int le1=1, ri1=1;
    while(ri1+1<=n && t[ri1+1].ty==t[ri1].ty)
    {
        ri1++;
        ans[ri1]=1e18;
        update(1, 0, n+2, ri1, 1e18);
    }
    //cout<<n<<endl;
    for(int j=ri1+1; j<=n; j++)
    {
        /////cout<<j<<" ";
        //cout<<j<<" c "<<le1<<" "<<ri1<<endl;
        if(t[j].ty!=t[j-1].ty && j!=ri1+1)
        {
            le1=ri1+1;
            ri1=j-1;
        }
        if(j-ri1>ri1-le1+1)
        {
            ans[j]=ans[j-1]+t[j].pos-t[ri1].pos;
          ///  //cout<<j<<" "<<ans[j]<<" "<<ans[j]-sp[j]<<endl;
            update(1, 0, n+2, j, ans[j]-sp[j]);
        }
        else if(j-ri1==ri1-le1+1)
        {
            //cout<<j<<" tuka: ";
            ans[j]=ans[j-1]+t[j].pos-t[ri1].pos;
            ans[j]=min(ans[j], min(ans[le1-1]+pref[j]-2*pref[ri1]+pref[le1-1], ans[le1]+pref[j]-2*pref[ri1]+pref[le1-1]));
            //cout<<j<<" "<<ans[j]<<" "<<ans[j]-sp[j]<<endl;
            //cout<<ans[le1-1]+pref[j]-2*pref[ri1]+pref[le1-1]<<" "<<ans[le1]+pref[j]-2*pref[ri1]+pref[le1-1]<<endl;
            update(1, 0, n+2, j, ans[j]-sp[j]);
        }
        else
        {
            ans[j]=ans[j-1]+t[j].pos-t[ri1].pos;
            int tid=query(1, 0, n+2, le1-1, ri1-j+ri1);
            //cout<<ans[j]<<" "<<tid<<endl;
            long long calc2=ans[tid];
            //cout<<calc2<<" ";
            tid++;
            calc2+=t[ri1+1].pos*(ri1-tid-(j-(ri1+1)));
            //cout<<calc2<<" ";
            calc2+=pref[j]-2*pref[ri1]+pref[tid-1];
            //cout<<calc2<<endl;
            if(calc2<ans[j]) ans[j]=calc2;
            //cout<<j<<" "<<ans[j]<<" "<<ans[j]-sp[j]<<endl;
            update(1, 0, n+2, j, ans[j]-sp[j]);
        }
        //cout<<ans[j]<<endl;
    }
	return ans[n];
}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:69:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for(int i=0; i<r.size(); i++) t[i+1]=point(1, r[i]);
      |                  ~^~~~~~~~~
wiring.cpp:70:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for(int i=0; i<b.size(); i++) t[i+r.size()+1]=point(0, b[i]);
      |                  ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
13.0 / 13.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 65 ms 11508 KB Output is correct
4 Correct 68 ms 12044 KB Output is correct
5 Correct 65 ms 11972 KB Output is correct
6 Correct 90 ms 15164 KB Output is correct
7 Correct 90 ms 15148 KB Output is correct
8 Correct 90 ms 15248 KB Output is correct
9 Correct 91 ms 15136 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 113 ms 15184 KB Output is correct
4 Correct 122 ms 14920 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 113 ms 15256 KB Output is correct
19 Correct 111 ms 15164 KB Output is correct
20 Correct 122 ms 15164 KB Output is correct
21 Correct 111 ms 15180 KB Output is correct
22 Correct 118 ms 15204 KB Output is correct
23 Correct 123 ms 15292 KB Output is correct
24 Correct 116 ms 15160 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 111 ms 14580 KB Output is correct
3 Correct 114 ms 14472 KB Output is correct
4 Correct 118 ms 14652 KB Output is correct
5 Correct 114 ms 14528 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 312 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 308 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 117 ms 14528 KB Output is correct
19 Correct 123 ms 14468 KB Output is correct
20 Correct 118 ms 14540 KB Output is correct
21 Correct 114 ms 14468 KB Output is correct
22 Correct 107 ms 14464 KB Output is correct
23 Correct 91 ms 14536 KB Output is correct
24 Correct 101 ms 14528 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 65 ms 11508 KB Output is correct
20 Correct 68 ms 12044 KB Output is correct
21 Correct 65 ms 11972 KB Output is correct
22 Correct 90 ms 15164 KB Output is correct
23 Correct 90 ms 15148 KB Output is correct
24 Correct 90 ms 15248 KB Output is correct
25 Correct 91 ms 15136 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 113 ms 15184 KB Output is correct
29 Correct 122 ms 14920 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 308 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 316 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 113 ms 15256 KB Output is correct
44 Correct 111 ms 15164 KB Output is correct
45 Correct 122 ms 15164 KB Output is correct
46 Correct 111 ms 15180 KB Output is correct
47 Correct 118 ms 15204 KB Output is correct
48 Correct 123 ms 15292 KB Output is correct
49 Correct 116 ms 15160 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 111 ms 14580 KB Output is correct
52 Correct 114 ms 14472 KB Output is correct
53 Correct 118 ms 14652 KB Output is correct
54 Correct 114 ms 14528 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 312 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 0 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 308 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 117 ms 14528 KB Output is correct
68 Correct 123 ms 14468 KB Output is correct
69 Correct 118 ms 14540 KB Output is correct
70 Correct 114 ms 14468 KB Output is correct
71 Correct 107 ms 14464 KB Output is correct
72 Correct 91 ms 14536 KB Output is correct
73 Correct 101 ms 14528 KB Output is correct
74 Correct 94 ms 15212 KB Output is correct
75 Correct 102 ms 14900 KB Output is correct
76 Correct 102 ms 15256 KB Output is correct
77 Correct 114 ms 14644 KB Output is correct
78 Correct 103 ms 14628 KB Output is correct
79 Correct 114 ms 14668 KB Output is correct
80 Correct 97 ms 14560 KB Output is correct
81 Correct 95 ms 14672 KB Output is correct
82 Correct 88 ms 14644 KB Output is correct
83 Correct 91 ms 14788 KB Output is correct
84 Correct 94 ms 15180 KB Output is correct
85 Correct 113 ms 15256 KB Output is correct
86 Correct 108 ms 15184 KB Output is correct
87 Correct 102 ms 15232 KB Output is correct
88 Correct 118 ms 15184 KB Output is correct
89 Correct 123 ms 15208 KB Output is correct
90 Correct 129 ms 15260 KB Output is correct
91 Correct 96 ms 15160 KB Output is correct
92 Correct 115 ms 15264 KB Output is correct
93 Correct 121 ms 15180 KB Output is correct
94 Correct 105 ms 15168 KB Output is correct
95 Correct 131 ms 15272 KB Output is correct
96 Correct 99 ms 15184 KB Output is correct
97 Correct 102 ms 15192 KB Output is correct
98 Correct 108 ms 15172 KB Output is correct
99 Correct 104 ms 15268 KB Output is correct
100 Correct 114 ms 15240 KB Output is correct
101 Correct 99 ms 15192 KB Output is correct
102 Correct 107 ms 15160 KB Output is correct