oj.uz

Submission #915610

# Submission time Handle Problem Language Result Execution time Memory
915610 2024-01-24T10:22:42 Z Matjaz Teleporters (IOI08_teleporters) C++14
5 / 100
 677 ms 65536 KB 
//
//  IOI2008Teleporters.cpp
//  
//
//  Created by Matjaz Leonardis on 24/01/2024.
//

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int N,M;

int main(){
    cin >> N >> M;
    vector<pair<int,int> > X(4*N);
    vector<int> next(4*N, -1);
    
    for (int i=0;i<N;i++){
        int W,E;
        cin >> W >> E;
        
        X.push_back(make_pair(W, 4 * i));
        X.push_back(make_pair(W, 4 * i + 1));
        X.push_back(make_pair(E, 4 * i + 2));
        X.push_back(make_pair(E, 4 * i + 3));
        next[4 * i] = 4 * i + 3;
        next[4 * i + 2] = 4 * i + 1;
    }
    
    sort(X.begin(), X.end());
    for (int i=0;i<X.size() - 1; i++){
        if (next[X[i].second] == -1) next[X[i].second] = X[i + 1].second;
    }
    
    
    int jumps = 0;
    vector<int> cycle;
    vector<bool> visited(4 * N, false);
    
    
    for (int i=0;i<X.size();i++){
        if (visited[X[i].second]) continue;
        
        int current = X[i].second;
        int l = 0;
        visited[X[i].second] = true;
        
        while (next[current] != X[i].second && next[current] != -1){
            l++;
            current = next[current];
            visited[current] = true;
        }

        if (i == 0){
            jumps += l;
        } else cycle.push_back(l);
    }
    
    sort(cycle.rbegin(), cycle.rend());
    for (int i=0;i<M;i++){
        if (i >= cycle.size()) jumps += 2; else
        jumps += (cycle[i] + 1) / 2 + 2;
        //if (i < cycle.size()) cout << cycle[i] << endl;
    }
    
    cout << jumps << endl;
    
    
    return 0;
}

Compilation message

teleporters.cpp: In function 'int main()':
teleporters.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for (int i=0;i<X.size() - 1; i++){
      |                  ~^~~~~~~~~~~~~
teleporters.cpp:44:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for (int i=0;i<X.size();i++){
      |                  ~^~~~~~~~~
teleporters.cpp:64:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         if (i >= cycle.size()) jumps += 2; else
      |             ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 5.0

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

Subtask #4
0 / 5.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

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

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 21 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 45 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -