제출 #239197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
239197		osaaateiasavtnl	Teleporters (IOI08_teleporters)	C++17	60 / 100	977 ms	40172 KiB

teleporters

#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int C = 2e6+7;
int who[C];

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n, m;
    cin >> n >> m;

    if (m > n)
        exit(1);


    vector <ii> a(n);
    vector <int> c = {0, 2 * 1000 * 1000 + 1};

    for (int i = 0; i < n; ++i) {
        cin >> a[i].f >> a[i].s;
        c.app(a[i].f);
        c.app(a[i].s);
        who[a[i].f] = i;
        who[a[i].s] = i;
    }   
    sort(all(c));

    int sz = c.size() - 1;
    vector <int> to(sz, -1);
    for (int i = 0; i + 2 < c.size(); ++i) {
        int u = who[c[i+1]];
        int x = a[u].f^a[u].s^c[i+1];
        to[i] = lower_bound(all(c), x) - c.begin();
    }   

    int ans = 0;

    vector <int> len;
    vector <bool> used(sz);
    for (int i = 0; i < sz; ++i) {
        if (!used[i]) {
            int u = i;
            int l = 0;
            while (u != -1 && !used[u]) {
                used[u] = 1;
                ++l;
                u = to[u];
            }

            if (u == -1) {
                ans += l;
            }   
            else {
                len.app(l);
            }
        }   
    }

    sort(all(len));
    reverse(all(len));
    for (int i = 0; i < min(m, (int)len.size()); ++i) {
        ans += len[i];
    }   
    ans += 2 * m - 1;
    cout << ans << endl;
}

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

teleporters.cpp: In function 'int main()':
teleporters.cpp:45:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i + 2 < c.size(); ++i) {
                     ~~~~~~^~~~~~~~~~

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