Submission #80148

#	Time	Username	Problem	Language	Result	Execution time	Memory
80148		Sherazin	Teleporters (IOI08_teleporters)	C++14	75 / 100	1083 ms	66560 KiB

teleporters

#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 2e6+5;

int n, m;
int chk[N], sz[N], comp;
vector<int> pos;
map<int, int> mp;

int get(int x) { return lower_bound(pos.begin(), pos.end(), x) - pos.begin(); }

int main() {
       scanf("%d %d", &n, &m);
       for(int i = 1, a, b; i <= n; i++) {
              scanf("%d %d", &a, &b);
              pos.emplace_back(a), pos.emplace_back(b);
              mp[a] = b, mp[b] = a;
       }
       pos.emplace_back(1e9);
       sort(pos.begin(), pos.end());
       for(int i = 0; i < 2*n; i++) if(!chk[i]) {
              chk[i] = ++comp;
              queue<int> Q;
              Q.emplace(i);
              while(!Q.empty()) {
                    int u = Q.front();
                    Q.pop();
                    ++sz[comp];
                    int v =  get(mp[pos[u]]) + 1;
                    if(chk[v] || v == 2*n) continue;
                    chk[v] = comp;
                    Q.emplace(v);
              }
       }
       int ans = sz[1];
       priority_queue<int> Q;
       for(int i = 2; i <= comp; i++) Q.emplace(sz[i]);
       while(!Q.empty() && m) {
            int z = Q.top();
            Q.pop();
            ans += z + 2, --m;
       }
       ans += 2*(m - (m & 1)) + (m & 1);
       printf("%d\n", ans);

       return 0;
}

Compilation message (stderr)

teleporters.cpp: In function 'int main()':
teleporters.cpp:19:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
        scanf("%d %d", &n, &m);
        ~~~~~^~~~~~~~~~~~~~~~~
teleporters.cpp:21:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
               scanf("%d %d", &a, &b);
               ~~~~~^~~~~~~~~~~~~~~~~

• 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: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5