제출 #660879

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660879		danikoynov	Palembang Bridges (APIO15_bridge)	C++14	22 / 100	102 ms	4976 KiB

bridge

#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 1e5 + 10;

struct work
{
    ll x, y;
}w[maxn];

int k, n;
void solve()
{
    cin >> k >> n;
    ll ans = 0;
    vector < ll > v;
    for (int i = 1; i <= n; i ++)
    {
        char c1, c2;
        cin >> c1 >> w[i].x >> c2 >> w[i].y;
              if (w[i].x > w[i].y)
            swap(w[i].x, w[i].y);
        if (c1 == c2)
        {
            ans = ans + w[i].y - w[i].x;
        }
        else
        {
            v.push_back(w[i].y);
            v.push_back(w[i].x);
            ans ++;
        }
    }

    sort(v.begin(), v.end());
    for (int i = 0; i < v.size() / 2; i ++)
        ans = ans - (v[i]);
        for (int i = v.size() / 2; i < v.size(); i ++)
            ans = ans + v[i];

        cout << ans << endl;


}

int main()
{
    solve();
    return 0;
}

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

bridge.cpp: In function 'void solve()':
bridge.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for (int i = 0; i < v.size() / 2; i ++)
      |                     ~~^~~~~~~~~~~~~~
bridge.cpp:46:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   46 |     for (int i = 0; i < v.size() / 2; i ++)
      |     ^~~
bridge.cpp:48:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   48 |         for (int i = v.size() / 2; i < v.size(); i ++)
      |         ^~~
bridge.cpp:48:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (int i = v.size() / 2; i < v.size(); i ++)
      |                                    ~~^~~~~~~~~~

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