Submission #283283

#TimeUsernameProblemLanguageResultExecution timeMemory
283283davi_bartWiring (IOI17_wiring)C++14
0 / 100
1 ms512 KiB
#include <bits/stdc++.h> #include <wiring.h> using namespace std; #define ll long long //#define int ll mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); /*vector<int> x, y; map<int,bool> vis[100010]; map<int,ll> memo[100010]; ll sol(int a,int b){ if(a==x.size() && b==y.size())return 0; if(vis[a][b])return memo[a][b]; vis[a][b]=1; if(a==x.size()){ ll t=0; for(int i=b;i<y.size();i++)t+=abs(y[i]-x.back()); return memo[a][b]=t; } if(b==y.size()){ ll t=0; for(int i=a;i<x.size();i++)t+=abs(x[i]-y.back()); return memo[a][b]=t; } ll best=1e16; best=min(best,sol(a+1,b+1)+abs(x[a]-y[b])); if(a>0 && x[a]>y[b])best=min(best,sol(a,b+1)+abs(x[a-1]-y[b])); if(b>0 && y[b]>x[a])best=min(best,sol(a+1,b)+abs(x[a]-y[b-1])); return memo[a][b]=best; }*/ vector<pair<int,int> >x; long long min_total_length(std::vector<int> r, std::vector<int> b) { /*x=r;y=b; return sol(0,0);*/ for(int a:r)x.push_back({a,1}); for(int a:b)x.push_back({a,0}); sort(x.begin(),x.end()); ll tot=0,aa=0,bb=0; for(auto k:x){ if(k.second){ aa=0; bb++; }else{ bb=0; aa++; } tot+=aa*(aa+1)/2+bb*(bb+1)/2; } return tot/2; }
#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...