Submission #961865

#	Time	Username	Problem	Language	Result	Execution time	Memory
961865		vjudge1	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	34 ms	4312 KiB

bridge

#include<bits/stdc++.h>

using namespace std;

#define int long long

int k, n;

namespace sub12{
   void solve(){
      vector<int> v;
      int ans=0;
      for (int i=1; i<=n; ++i){
         char c1, c2; int p1, p2;
         cin >> c1 >> p1 >> c2 >> p2;
         if (c1==c2) ans+=abs(p1-p2);
         else v.push_back(p1), v.push_back(p2);
      }
      sort(v.begin(), v.end());
      if (v.size()){
         int pos=v[(int)v.size()/2];
         for (int i:v) ans+=abs(pos-i);
      }
      cout << ans+(int)v.size()/2 << '\n';
   }
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> k >> n;
   if (k==1) sub12::solve();
   return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37