Submission #1025584

#TimeUsernameProblemLanguageResultExecution timeMemory
1025584amirhoseinfar1385Wiring (IOI17_wiring)C++17
0 / 100
1 ms3416 KiB
#include "wiring.h" #include<bits/stdc++.h> using namespace std; const int maxn=200000+10; long long dp[maxn],inf=1e16,vas[maxn]; int n,m; vector<int>allind; long long min_total_length(std::vector<int> r, std::vector<int> b) { n=(int)r.size(); m=(int)b.size(); allind.push_back(-1); for(auto x:r){ allind.push_back(x); } for(auto x:b){ allind.push_back(x); } sort(allind.begin(),allind.end()); allind.resize(unique(allind.begin(),allind.end())-allind.begin()); for(int i=0;i<n;i++){ r[i]=lower_bound(allind.begin(),allind.end(),r[i])-allind.begin(); vas[r[i]]=1; } for(int i=0;i<m;i++){ b[i]=lower_bound(allind.begin(),allind.end(),b[i])-allind.begin(); vas[b[i]]=2; } for(int i=1;i<maxn;i++){ dp[i]=inf; } dp[0]=0; int sz=(int)allind.size(); for(int i=1;i<sz;i++){ long long av=allind[i],unnow=0,last=i,bar=0,akh; for(int j=i-1;j>=1;j--){ if(vas[j]==vas[i]&&vas[j]!=vas[j+1]){ break; } if(vas[j]==vas[i]){ last=j; unnow+=av; av=allind[i]; }else{ bar+=allind[i]; akh=allind[last-1]; int ted1=i-last+1; int ted2=(last-1)-j+1; dp[i]=min(dp[i],dp[j-1]+unnow-(bar-akh)+max(1,ted2-ted1)*av-max(1,ted1-ted2)*akh); } } } return dp[sz-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...