Submission #1176672

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176672		ElayV13	Palembang Bridges (APIO15_bridge)	C++20	0 / 100	0 ms	328 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define FOR(a , b) for(int i = a;i <= b;i++)
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MXN = 100005;
const int INF = 1e18;
const int mod = 1e9 + 7;

int k , n , s[MXN] , t[MXN];
char p[MXN] , q[MXN];

int calc(int point)
{
        int res = 0;
        for(int i = 1;i <= n;i++)
        {
                if(p[i] == q[i])
                {
                        res += (abs(s[i] - t[i]));
                        continue;
                }
                ++res;
                res += (abs(s[i] - point)) + (abs(t[i] - point));
        }
        return res;
}

signed main(){
      ios_base::sync_with_stdio(0);
      cin.tie(0);cout.tie(0);
      cin >> k >> n;
      for(int i = 1;i <= n;i++)
      {
              cin >> p[i] >> s[i] >> q[i] >> t[i];
      }
      vector < int > pos;
      map < int , int > used;
      for(int i = 1;i <= n;i++){
                if(!used[s[i]]){
                        pos.push_back(s[i]);
                        used[s[i]] = 1;
                }
                if(!used[t[i]]){
                        pos.push_back(t[i]);
                        used[t[i]] = 1;
                }
      }
      sort(pos.begin() , pos.end());
      int pointer = 0;
      int res = INF;
      int cur_res = calc(pos[pointer]);
      while(pointer < pos.size()){
                if(pointer == 0){
                        res = min(res , cur_res);
                        ++pointer;
                        continue;
                }
                int point = pos[pointer];
                for(int i = 1;i <= n;i++)
                {
                        if(p[i] == q[i]) continue;
                        if(s[i] >= point) cur_res--;
                        else cur_res++;
                        if(s[i] == t[i]) continue;
                        if(t[i] >= point) cur_res--;
                        else cur_res++;
                }
                res = min(res , cur_res);
                ++pointer;
      }
      cout << res << endl;;
}

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