제출 #882563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
882563		vjudge1	Palembang Bridges (APIO15_bridge)	C++17	22 / 100	82 ms	110272 KiB

bridge

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;



ll solv(vector<pair<ll, ll>> &v){
  if(v.size() == 0) return 0ll;
  vector<pair<ll, ll>> pref(v.size());
  vector<pair<ll, ll>> suf(v.size());
  pref[0] = {0, 0};
  for(int i = 1; i < v.size(); ++i){
    pref[i] = pref[i - 1];
    if(v[i].second == 1) pref[i].first += v[i].first, pref[i].second++;
  }
  suf[v.size() - 1] = {0, 0};
  for(int i = v.size() - 2; i >= 0; --i){
    suf[i] = suf[i + 1];
    if(v[i].second == 0) suf[i].first += v[i].first, suf[i].second++;
  }
  ll best = 1e18;
  for(int i = 0; i < v.size(); ++i){
    if(abs(suf[i].second - pref[i].second) <= 1)
    best = min(best, suf[i].first - pref[i].first + (v[i].first * pref[i].second) - (v[i].first * suf[i].second));
  }
  return best*2;
}

int k, n;
ll ans = 0;
pair<ll, ll> pref[N], suf[N], prefL[N], sufR[N];
array<ll, 2> a[N];
vector<int> L[N];
set<int> R[N];

void solve(){
  cin >> k >> n;
  int c = 0;
  for(int i = 1; i <= n; ++i){
    char c1, c2; ll x1, x2; cin >> c1 >> x1 >> c2 >> x2;
    if(c1 == c2){
      ans += abs(x1-x2);
    }else{
      ++c;
      a[c][0] = min(x1, x2);
      a[c][1] = max(x1, x2);
      ans += abs(x1-x2);
      // cout << a[c][0] << ' '<< a[c][1] << '\n';
    }
  }
  n = c;
  if(n==0){
    cout << ans;
    return;
  }
  sort(a+1, a+1+n);

  vector<pair<ll, ll>> v;
  vector<array<ll, 3>> vv;
  for(int i = 1; i <= n; ++i) v.pb({a[i][0], 0}), v.pb({a[i][1], 1});
  for(int i = 1; i <= n; ++i) vv.pb({a[i][0], 0, i}), vv.pb({a[i][1], 1, i});

  sort(all(v));
  sort(all(vv));
  pref[0] = {0, 0};
  prefL[0] = {0, 0};
  for(int i = 1; i < v.size(); ++i){
    pref[i] = pref[i - 1];
    prefL[i] = prefL[i - 1];
    if(v[i].second == 1) pref[i].first += v[i].first, pref[i].second++;
    if(v[i].second == 0) prefL[i].first += v[i].first, prefL[i].second++;
  }

  suf[v.size() - 1] = {0, 0};
  sufR[v.size() - 1] = {0, 0};
  for(int i = v.size() - 2; i >= 0; --i){
    suf[i] = suf[i + 1];
    sufR[i] = sufR[i + 1];
    if(v[i].second == 0) suf[i].first += v[i].first, suf[i].second++;
    if(v[i].second == 1) sufR[i].first += v[i].first, sufR[i].second++;
  }

  if(k == 1){
    ll best = 1e18;
    for(int i = 0; i < v.size(); ++i){
      if(abs(suf[i].second - pref[i].second) <= 1)
      best = min(best, suf[i].first - pref[i].first + (v[i].first * pref[i].second) - (v[i].first * suf[i].second));
    }
    cout << ans + best*2 + n; 
  }else{
    ll best = 1e18;

    for(int i = 0; i <= n*2; ++i){
      vector<pair<ll, ll>> A, B;
      vector<bool> used(n+1, 0);
      for(int j = 0 ; j < 2*n; ++j){
        if(j<i)
          A.pb({vv[j][0], vv[j][1]}), used[vv[j][2]] = 1;
        else if(!used[vv[j][2]])
          B.pb({vv[j][0], vv[j][1]});
        else
          A.pb({vv[j][0], vv[j][1]});
      }
      best = min(best, solv(A) + solv(B));
    }
    cout << ans + best + n;
    return;


    suf[2*n] = {0, 0};
    for(int i = 0; i < v.size(); ++i) R[pref[i].second - suf[i].second + M].insert(i);
    for(int i = 0; i < v.size(); ++i){
      if(abs(suf[i].second - pref[i].second) <= 1)
        best = min(best, suf[i].first - pref[i].first + (v[i].first * pref[i].second) - (v[i].first * suf[i].second));
    }
    for(int i = 0; i < v.size(); ++i){
      int x = pref[i].second - suf[i].second + M;
      L[x].pb(i);
      R[x].erase(i);
      
      int y = suf[i + 1].second;
      int y2 = -pref[i].second;
      for(int j = y + M - 2; j <= y + M + 2; ++j){
        for(int j2 = y2 + M - 2; j2 <= y2 + M + 2; ++j2){
          for(auto l: L[j]){
            for(auto r: R[j2]){
              best = min(best,
                (suf[l].first - suf[i + 1].first) - pref[l].first + (pref[l].second - (suf[l].second - suf[i + 1].second)) * v[l].first + 
                suf[r].first - (pref[r].first - pref[i].first) + ((pref[r].second - pref[i].second) - suf[r].second) * v[r].first 
              );
            }
          }
        }
      }
    }
    cout << ans + 2*best + n;
  }

}



int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

컴파일 시 표준 에러 (stderr) 메시지

bridge.cpp: In function 'long long int solv(std::vector<std::pair<long long int, long long int> >&)':
bridge.cpp:19:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   for(int i = 1; i < v.size(); ++i){
      |                  ~~^~~~~~~~~~
bridge.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   for(int i = 0; i < v.size(); ++i){
      |                  ~~^~~~~~~~~~
bridge.cpp: In function 'void solve()':
bridge.cpp:74:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for(int i = 1; i < v.size(); ++i){
      |                  ~~^~~~~~~~~~
bridge.cpp:92:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     for(int i = 0; i < v.size(); ++i){
      |                    ~~^~~~~~~~~~
bridge.cpp:118:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |     for(int i = 0; i < v.size(); ++i) R[pref[i].second - suf[i].second + M].insert(i);
      |                    ~~^~~~~~~~~~
bridge.cpp:119:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for(int i = 0; i < v.size(); ++i){
      |                    ~~^~~~~~~~~~
bridge.cpp:123:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     for(int i = 0; i < v.size(); ++i){
      |                    ~~^~~~~~~~~~
bridge.cpp: In function 'int main()':
bridge.cpp:152:15: warning: unused variable 'aa' [-Wunused-variable]
  152 |   int tt = 1, aa;
      |               ^~

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