제출 #649240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
649240		Spade1	Teleporters (IOI08_teleporters)	C++14	100 / 100	432 ms	40568 KiB

teleporters

#include<bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;

const int N = 2e6 + 10;

int to[N];
int cnt[N], srt[N];
bool vis[N];
vector<pii> tp;

void solve() {
    int n, m; cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        int a, b; cin >> a >> b;
        cnt[a]++;
        cnt[b]++;
        tp.pb({a, b});
    }

    for (int i = 1; i < N; ++i) {
        cnt[i] += cnt[i-1];
    }

    for (auto [a, b] : tp) {
        to[cnt[a-1]] = cnt[b];
        to[cnt[b-1]] = cnt[a];
    }

    int ans = 0;
    for (int i = 0; i < 2*n; ++i) {
        if (vis[i]) continue;
        int cntt = 0;
        while (!vis[i]) {
            vis[i] = 1;
            cntt++;
            i = to[i];
        }
        if (i == 0) {
            ans = cntt;
        }
        else srt[cntt]++;
    }

    for (int i = N-1; i > 0; --i) {
        if (srt[i] <= m) {
            m -= srt[i];
            ans += (srt[i]*i) + 2*srt[i];
        }
        else {
            ans += m*i + 2*m;
            m = 0;
            break;
        }
    }

    if (m > 0) {
        if (m&1) {
            ans += 2*(m-1)+1;
        }
        else {
            ans += 2*m;
        }
    }

    cout << ans-1 << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

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

teleporters.cpp: In function 'void solve()':
teleporters.cpp:32:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |     for (auto [a, b] : tp) {
      |               ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5