Submission #1225947

#TimeUsernameProblemLanguageResultExecution timeMemory
1225947jakeob77Palembang Bridges (APIO15_bridge)C++17
22 / 100
25 ms1476 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ins insert //cout<<fixed<<setprecision(3); 3 decimalke brez fixed pa 3 zanesljiva mesta const int MAXN=1e6+3; const long long linf=1e18; const int inf=1e9; const int mod=1e9+7; void solve(){ int k,n;cin>>k>>n; ll res=0; vector<int>house; for(int i=0;i<n;i++){ char t,tt;int p,pp; cin>>t>>p>>tt>>pp; if(tt==t){ res+=abs(pp-p); } else{ res++; house.pb(p);house.pb(pp); } } sort(house.begin(),house.end()); if(k==1){ int m=house.size(); ll mn1=res; for(int i=0;i<m;i++){ mn1+=abs(house[i]-house[m/2]); } cout<<mn1<<endl; } else{ cout<<-1<<endl; } } int main(){ std::ios::sync_with_stdio(false); std::cin.tie(NULL); int t=1; while(t--) solve(); }
#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...