Submission #332846

#TimeUsernameProblemLanguageResultExecution timeMemory
332846errorgornPalembang Bridges (APIO15_bridge)C++17
0 / 100
1 ms364 KiB
//雪花飄飄北風嘯嘯 //天地一片蒼茫 #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <ext/rope> using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx; #define ll long long #define ii pair<ll,ll> #define iii pair<ii,ll> #define fi first #define se second #define endl '\n' #define debug(x) cout << #x << " is " << x << endl #define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--)) #define all(x) (x).begin(),(x).end() #define sz(x) (int)(x).size() #define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> //change less to less_equal for non distinct pbds, but erase will bug mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); int n,k; vector<ii> v; priority_queue<int,vector<int>,greater<int> > pq; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin.exceptions(ios::badbit | ios::failbit); cin>>k>>n; char ca,cb; int qa,qb; ll same=0; rep(x,0,n){ cin>>ca>>qa>>cb>>qb; same+=abs(qa-qb); if (ca!=cb) v.push_back(ii(min(qa,qb),max(qa,qb))),same++; } sort(all(v),[](ii i,ii j){ return i.fi+i.se<j.fi+j.se; }); if (k==1){ ll ans=1e18; int delta=-sz(v); ll curr=0; for (auto &it:v){ //cout<<it.fi<<" "<<it.se<<endl; pq.push(it.fi); pq.push(it.se); curr+=it.fi; } int pos=0; while (!pq.empty()){ int temp=pq.top(); pq.pop(); curr+=delta*(temp-pos); pos=temp; delta++; ans=min(ans,curr); //cout<<curr<<endl; } cout<<ans*2+same<<endl; } }
#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...