oj.uz

Submission #56477

# Submission time Handle Problem Language Result Execution time Memory
56477 2018-07-11T12:45:21 Z aquablitz11 Teleporters (IOI08_teleporters) C++14
85 / 100
 689 ms 66560 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1000010;

int n, m;
int A[N], B[N], pos[2*N], coord[2*N], nxt[2*N], cycle[N], cc;
bool vis[2*N];

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; ++i) {
        scanf("%d%d", &A[i], &B[i]);
        coord[2*i+1] = A[i];
        coord[2*i+2] = B[i];
    }
    sort(coord, coord+2*n+1);
    for (int i = 0; i < 2*n+1; ++i)
        pos[coord[i]] = i;
    for (int i = 0; i < n; ++i) {
        nxt[pos[A[i]]-1] = pos[B[i]];
        nxt[pos[B[i]]-1] = pos[A[i]];
    }

    int ans = 0;
    for (int s = 0; s < 2*n; ++s) {
        if (vis[s]) continue;
        for (int u = s, c = 1; ; ++c) {
            vis[u] = true;
            u = nxt[u];
            if (vis[u]) {
                cycle[cc++] = c;
                break;
            } else if (u == 2*n) {
                ans = c;
                break;
            }
        }
    }
    sort(cycle, cycle+cc);
    while (m--) {
        if (cc > 0) {
            ans += cycle[--cc]+2;
        } else {
            ++ans;
            cycle[cc++] = 1;
        }
    }
    printf("%d\n", ans);

    return 0;
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
teleporters.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &A[i], &B[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 364 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 548 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 548 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 704 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 704 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 704 KB Output is correct

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 792 KB Output is correct
2 Correct 10 ms 1336 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1336 KB Output is correct
2 Correct 8 ms 1752 KB Output is correct
3 Correct 16 ms 2280 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2280 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2280 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 8640 KB Output is correct
2 Correct 226 ms 22160 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 22160 KB Output is correct
2 Correct 379 ms 36872 KB Output is correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 51536 KB Output is correct
2 Correct 532 ms 63232 KB Output is correct
3 Runtime error 535 ms 66560 KB Memory limit exceeded 66560 {'time-wall': '0.588', 'max-rss': '32092', 'csw-forced': '269', 'cg-mem': '66560', 'time': '0.535', 'csw-voluntary': '4'} 65536

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 601 ms 66560 KB Memory limit exceeded 66560 {'time-wall': '0.658', 'max-rss': '33204', 'csw-forced': '46', 'cg-mem': '66560', 'time': '0.601', 'csw-voluntary': '3'} 65536
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 689 ms 66560 KB Memory limit exceeded 66560 {'time-wall': '0.742', 'max-rss': '37276', 'csw-forced': '24', 'cg-mem': '66560', 'time': '0.689', 'csw-voluntary': '3'} 65536
2 Halted 0 ms 0 KB -