# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
915604 | Matjaz | Teleporters (IOI08_teleporters) | C++14 | 681 ms | 65536 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//
// 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 += 4; else
jumps += cycle[i] + 3;
}
cout << jumps << endl;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |