# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915599 | Matjaz | Teleporters (IOI08_teleporters) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//
// IOI2008Teleporters.cpp
//
//
// Created by Matjaz Leonardis on 24/01/2024.
//
#include <iostream>
#include <vector>
using namespace std;
int N,M;
int main(){
cin >> N >> M;
vector<int> W(N),E(N);
vector<pair<int,int> > X(4*N);
vector<int> next(4*N, -1);
for (int i=0;i<N;i++){
cin >> W[i] >> E[i];
X.push_back(make_pair(W[i], 4 * i));
X.push_back(make_pair(W[i], 4 * i + 1));
X.push_back(make_pair(E[i], 4 * i + 2));
X.push_back(make_pair(E[i], 4 * i + 3));
next[4 * i] = 4 * i + 3;
next[4 * i + 2] = 4 * i + 1;
}