oj.uz

Submission #815512

# Submission time Handle Problem Language Result Execution time Memory
815512 2023-08-08T16:15:07 Z alexander707070 Wiring (IOI17_wiring) C++14
17 / 100
 1000 ms 14416 KB 
#include<bits/stdc++.h>
#define MAXN 200007
using namespace std;
 
const long long inf=1e17;
 
int n,m,last[2],start;
pair<long long,int> p[MAXN];
long long dp[MAXN];
int pref[MAXN][2],len;
long long sum[MAXN][2],prefmin;
int pr[MAXN][2],nxt[MAXN][2];
 
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 cost(int l,int r){
    if(p[l].second==0 and p[r].second==1){
        if(cnt(l,r,0)<=cnt(l,r,1)){
            return  getsum(l,r,1) - ( getsum(l,r,0) + (cnt(l,r,1)-cnt(l,r,0))*p[pr[r][0]].first );
        }else{
            return  getsum(l,r,1) + (cnt(l,r,0)-cnt(l,r,1))*p[nxt[l][1]].first - getsum(l,r,0);
        }
    }else{
        if(cnt(l,r,0)<=cnt(l,r,1)){
            return getsum(l,r,0) + (cnt(l,r,1)-cnt(l,r,0))*p[nxt[l][0]].first - getsum(l,r,1);
        }else{
            return getsum(l,r,0) - ( (cnt(l,r,0)-cnt(l,r,1))*p[pr[r][1]].first + getsum(l,r,1) );
        }
    }
}
 
bool ok(int l,int r){
    if(p[l].second==p[r].second)return false;
    if(p[l].second==0){
        return nxt[l][1]-1==pr[r][0];
    }else{
        return nxt[l][0]-1==pr[r][1];
    }
}
 
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){
    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;
        dp[i]=inf;

        prefmin-=p[start].first;
        if(len<=start 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));
        }

        dp[i]=getsum(start+1,i,p[i].second)+prefmin;
 
        for(int f=start-len;f>=1;f--){
            if(!ok(f,i))break;
            dp[i]=min(dp[i],dp[f-1]+cost(f,i));
            dp[i]=min(dp[i],dp[f]+cost(f,i));
        }
    }
 
    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:81:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for(int i=0;i<r.size();i++){
      |                 ~^~~~~~~~~
wiring.cpp:84:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i=0;i<b.size();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 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 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 1 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 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Execution timed out 1083 ms 10504 KB Time limit exceeded
4 Halted 0 ms 0 KB -

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 42 ms 14272 KB Output is correct
4 Correct 44 ms 14300 KB Output is correct
5 Correct 0 ms 340 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 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 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 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 49 ms 14256 KB Output is correct
19 Correct 48 ms 14340 KB Output is correct
20 Correct 47 ms 14276 KB Output is correct
21 Correct 41 ms 14284 KB Output is correct
22 Correct 50 ms 14416 KB Output is correct
23 Correct 43 ms 14292 KB Output is correct
24 Correct 42 ms 14276 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Execution timed out 1075 ms 13124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.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 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 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 1 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 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 1 ms 308 KB Output is correct
19 Execution timed out 1083 ms 10504 KB Time limit exceeded
20 Halted 0 ms 0 KB -