oj.uz

Submission #239205

# Submission time Handle Problem Language Result Execution time Memory
239205 2020-06-14T19:31:08 Z osaaateiasavtnl Teleporters (IOI08_teleporters) C++14
45 / 100
 918 ms 38492 KB 
#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;
 
    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;

    if (m > len.size())
        ans -= 2 * (m - len.size());

    cout << ans << endl;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 768 KB Output isn't correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1024 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 5852 KB Output is correct
2 Correct 257 ms 15004 KB Output is correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 157 ms 11096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 557 ms 26808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 842 ms 32472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 918 ms 38492 KB Output isn't correct
2 Halted 0 ms 0 KB -