oj.uz

Submission #815545

# Submission time Handle Problem Language Result Execution time Memory
815545 2023-08-08T16:47:29 Z alexander707070 Wiring (IOI17_wiring) C++14
100 / 100
 78 ms 20944 KB 
#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;
 
const long long inf=1e17;
 
int n,m,last[2],start,cntt;
pair<long long,int> p[MAXN];
long long dp[MAXN],curr,len;
int pref[MAXN][2];
long long sum[MAXN][2],prefmin;
int pr[MAXN][2],nxt[MAXN][2];
multiset<long long> s;
 
long long cnt(int l,int r,int id){
    return pref[r][id]-pref[l-1][id];
}
 
long long getsum(int l,int r,int id){
    return sum[r][id]-sum[l-1][id];
}

long long mins(){
    return *s.begin();
}
 
void precalc(){
    for(int i=1;i<=n+m;i++){
        if(p[i].second==0){
            pref[i][0]++; sum[i][0]+=p[i].first;
        }else{
            pref[i][1]++; sum[i][1]+=p[i].first;
        }
 
        pref[i][0]+=pref[i-1][0];
        pref[i][1]+=pref[i-1][1];
 
        sum[i][0]+=sum[i-1][0];
        sum[i][1]+=sum[i-1][1];
    }
 
    last[0]=last[1]=0;
    for(int i=1;i<=n+m;i++){
        pr[i][0]=last[0]; pr[i][1]=last[1];
 
        if(p[i].second==0)last[0]=i;
        else last[1]=i;
    }
 
    last[0]=last[1]=n+m+1;
    for(int i=n+m;i>=1;i--){
        nxt[i][0]=last[0]; nxt[i][1]=last[1];
        
        if(p[i].second==0)last[0]=i;
        else last[1]=i;
    }
}
 
long long min_total_length(vector<int> r,vector<int> b){

    double st=clock();
    
    n=int(r.size()); m=int(b.size());
    for(int i=0;i<r.size();i++){
        p[i+1]={r[i],0};
    }
    for(int i=0;i<b.size();i++){
        p[r.size()+i+1]={b[i],1};
    }
 
    sort(p+1,p+n+m+1);
    precalc();
 
    for(int i=1;i<=n+m;i++){
        if(p[i].second==0)start=pr[i][1];
        else start=pr[i][0];

        len=i-start; 
        if(len==1){
            prefmin=inf; s.clear();
            for(int f=start;f>=1 and p[f].second==p[start].second;f--){
                curr=start-f+1;
                s.insert( min(dp[f-1],dp[f])-getsum(f,start,p[start].second)+curr*p[start+1].first );
            }
        }

        dp[i]=inf;

        prefmin-=p[start].first;
        if(len<=start and nxt[start-len+1][p[i].second]==start+1 and p[start-len+1].second==p[start].second){
            prefmin=min(prefmin,dp[start-len]-getsum(start-len+1,start,p[start].second));
            prefmin=min(prefmin,dp[start-len+1]-getsum(start-len+1,start,p[start].second));
            
            s.erase( s.find( min(dp[start-len+1],dp[start-len])-getsum(start-len+1,start,p[start].second)+len*p[start+1].first ) );
        }

        dp[i]=min(dp[i], getsum(start+1,i,p[i].second) + prefmin);
        if(!s.empty())dp[i]=min(dp[i], getsum(start+1,i,p[i].second) + mins() - len*p[start+1].first);
    }
 
    return dp[n+m];
}
 
/*
int main(){
    cout<<min_total_length({1, 2, 3, 7}, {0, 4, 5, 9, 10})<<"\n";
}
*/

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:64:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i=0;i<r.size();i++){
      |                 ~^~~~~~~~~
wiring.cpp:67:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i=0;i<b.size();i++){
      |                 ~^~~~~~~~~
wiring.cpp:61:12: warning: unused variable 'st' [-Wunused-variable]
   61 |     double st=clock();
      |            ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 340 KB Output is correct
15 Correct 0 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 272 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 37 ms 15500 KB Output is correct
4 Correct 37 ms 16936 KB Output is correct
5 Correct 28 ms 14668 KB Output is correct
6 Correct 46 ms 20936 KB Output is correct
7 Correct 47 ms 20944 KB Output is correct
8 Correct 46 ms 20916 KB Output is correct
9 Correct 45 ms 20916 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 53 ms 14352 KB Output is correct
4 Correct 44 ms 14308 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 43 ms 14284 KB Output is correct
19 Correct 43 ms 14332 KB Output is correct
20 Correct 46 ms 14352 KB Output is correct
21 Correct 43 ms 14300 KB Output is correct
22 Correct 44 ms 14300 KB Output is correct
23 Correct 56 ms 14284 KB Output is correct
24 Correct 43 ms 14284 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 47 ms 14740 KB Output is correct
3 Correct 43 ms 15548 KB Output is correct
4 Correct 67 ms 15680 KB Output is correct
5 Correct 54 ms 15564 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 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 54 ms 17460 KB Output is correct
19 Correct 62 ms 15656 KB Output is correct
20 Correct 47 ms 15608 KB Output is correct
21 Correct 67 ms 16436 KB Output is correct
22 Correct 64 ms 19452 KB Output is correct
23 Correct 51 ms 19804 KB Output is correct
24 Correct 52 ms 18928 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 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 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 272 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 37 ms 15500 KB Output is correct
20 Correct 37 ms 16936 KB Output is correct
21 Correct 28 ms 14668 KB Output is correct
22 Correct 46 ms 20936 KB Output is correct
23 Correct 47 ms 20944 KB Output is correct
24 Correct 46 ms 20916 KB Output is correct
25 Correct 45 ms 20916 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 53 ms 14352 KB Output is correct
29 Correct 44 ms 14308 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 43 ms 14284 KB Output is correct
44 Correct 43 ms 14332 KB Output is correct
45 Correct 46 ms 14352 KB Output is correct
46 Correct 43 ms 14300 KB Output is correct
47 Correct 44 ms 14300 KB Output is correct
48 Correct 56 ms 14284 KB Output is correct
49 Correct 43 ms 14284 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 47 ms 14740 KB Output is correct
52 Correct 43 ms 15548 KB Output is correct
53 Correct 67 ms 15680 KB Output is correct
54 Correct 54 ms 15564 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 1 ms 304 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 304 KB Output is correct
64 Correct 1 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 54 ms 17460 KB Output is correct
68 Correct 62 ms 15656 KB Output is correct
69 Correct 47 ms 15608 KB Output is correct
70 Correct 67 ms 16436 KB Output is correct
71 Correct 64 ms 19452 KB Output is correct
72 Correct 51 ms 19804 KB Output is correct
73 Correct 52 ms 18928 KB Output is correct
74 Correct 53 ms 20272 KB Output is correct
75 Correct 54 ms 18348 KB Output is correct
76 Correct 66 ms 19352 KB Output is correct
77 Correct 59 ms 18644 KB Output is correct
78 Correct 53 ms 19000 KB Output is correct
79 Correct 52 ms 18644 KB Output is correct
80 Correct 51 ms 18896 KB Output is correct
81 Correct 54 ms 19920 KB Output is correct
82 Correct 51 ms 20024 KB Output is correct
83 Correct 46 ms 19768 KB Output is correct
84 Correct 51 ms 20792 KB Output is correct
85 Correct 66 ms 18556 KB Output is correct
86 Correct 53 ms 19492 KB Output is correct
87 Correct 52 ms 19564 KB Output is correct
88 Correct 54 ms 19008 KB Output is correct
89 Correct 52 ms 19128 KB Output is correct
90 Correct 66 ms 19112 KB Output is correct
91 Correct 54 ms 20276 KB Output is correct
92 Correct 60 ms 19420 KB Output is correct
93 Correct 61 ms 19596 KB Output is correct
94 Correct 52 ms 20024 KB Output is correct
95 Correct 56 ms 18872 KB Output is correct
96 Correct 51 ms 19984 KB Output is correct
97 Correct 55 ms 20812 KB Output is correct
98 Correct 55 ms 20504 KB Output is correct
99 Correct 61 ms 20388 KB Output is correct
100 Correct 56 ms 19508 KB Output is correct
101 Correct 54 ms 20148 KB Output is correct
102 Correct 78 ms 19636 KB Output is correct