Submission #589593

#TimeUsernameProblemLanguageResultExecution timeMemory
5895931nePalembang Bridges (APIO15_bridge)C++14
31 / 100
44 ms4864 KiB
#include<bits/stdc++.h> using namespace std; struct node{ char p,q; long long s,t; void inn(){ cin>>p>>s>>q>>t; } }; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int k,n;cin>>k>>n; vector<node>arr(n); vector<long long>brr; for (int i = 0;i<n;++i){ arr[i].inn(); if (arr[i].p!=arr[i].q){ brr.push_back(arr[i].s); brr.push_back(arr[i].t); } } const long long mxn = 1e18; long long ans = mxn; sort(brr.begin(),brr.end()); if (k == 1 || brr.size() <= 1){ for (int i = 0;i<2;++i){ long long curans = 0; int temp = (int)brr.size()/2 - 1 + i; for (int j = 0;j<n;++j){ if (arr[j].p == arr[j].q){ curans+=abs(arr[j].t - arr[j].s); } else{ curans+=abs(arr[j].t - brr[temp]) + abs(arr[j].s - brr[temp]) + 1; } } ans = min(ans,curans); } } brr.erase(unique(brr.begin(),brr.end()),brr.end()); if (k == 2 && (int)brr.size() > 1 && n<=100){ for (int x = 0;x<(int)brr.size();++x){ for (int y = 0;y<(int)brr.size();++y){ long long curans = 0; for (int j = 0;j<n;++j){ if (arr[j].p == arr[j].q){ curans+=abs(arr[j].t - arr[j].s); } else{ curans+=min(llabs(arr[j].t - brr[x]) + llabs(arr[j].s - brr[x]),llabs(arr[j].t - brr[y]) + llabs(arr[j].s - brr[y])) + 1LL; } } ans = min(curans,ans); } } } if (k == 2){ vector<pair<int,int>>seg; for (auto x:arr){ if (x.q!=x.p){ int f = lower_bound(brr.begin(),brr.end(),x.s) - brr.begin(); int t = lower_bound(brr.begin(),brr.end(),x.t) - brr.begin(); seg.push_back({f,t}); } } vector<int>pref((int)brr.size() + 1,0); for (auto x:seg){ pref[x.first]++; pref[x.second + 1]--; } int maxxy1 = -1; int index1 = -1; for (int i = 1;i<=(int)brr.size();++i){ pref[i]+=pref[i - 1]; } for (int i = 0;i<(int)brr.size();++i){ if (pref[i] > maxxy1){ maxxy1 = pref[i]; } } vector<int>pos; for (int i = 0;i<(int)brr.size();++i){ if (pref[i] == maxxy1)pos.push_back(i); } for (auto x:pos){ for (int y = 0;y<(int)brr.size();++y){ long long curans = 0; for (int j = 0;j<n;++j){ if (arr[j].p == arr[j].q){ curans+=abs(arr[j].t - arr[j].s); } else{ curans+=min(llabs(arr[j].t - brr[x]) + llabs(arr[j].s - brr[x]),llabs(arr[j].t - brr[y]) + llabs(arr[j].s - brr[y])) + 1LL; } } ans = min(curans,ans); } } } cout<<ans<<'\n'; return 0; }

Compilation message (stderr)

bridge.cpp: In function 'int main()':
bridge.cpp:73:7: warning: unused variable 'index1' [-Wunused-variable]
   73 |   int index1 = -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...