제출 #640653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640653		devariaota	Palembang Bridges (APIO15_bridge)	C++17	0 / 100	1 ms	444 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
typedef long long ll;
// const ll mod = 1e9 + 7;
const ll MAXN = 1e6 + 5;
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define sc second
#define endl '\n'
#define gl                        ios_base::sync_with_stdio(0);   cin.tie(0);                     cout.tie(0)

int main()
{
  gl;
  int k, n;
  cin >> k >> n;

  int sum = 0;

  vi v;
  for (int i = 0; i < n; i++)
  {
    char a, b;
    int x, y;
    cin >> a >> x >> b >> y;
    if (a == b)
      sum += abs(x - y);
    else
    {
      sum++;
      v.pb(x);
      v.pb(y);
    }
  }

  sort(v.begin(), v.end());

  int l = v[0], r = v[v.size() - 1];

  vll ps(r + 5, 0);
  vi b(r + 5, 0);

  for (int i = 0; i < v.size(); i++)
  {
    ps[v[i]] += v[i];
    b[v[i]]++;
  }

  for (int i = 1; i <= r; i++)
  {
    ps[i] += ps[i - 1];
    b[i] += b[i - 1];
  }

  ll ans = 1e18;

  for (int i = l; i <= r; i++)
  {
    ans = min(ans, 2 * i * b[i] - i * b[r] + ps[r] - 2 * ps[i]);
  }

  cout << ans + sum << endl;

  return 0;
}

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

bridge.cpp: In function 'int main()':
bridge.cpp:51:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   for (int i = 0; i < v.size(); i++)
      |                   ~~^~~~~~~~~~

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