# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1136973 | the_coding_pooh | Roller Coaster Railroad (IOI16_railroad) | C++20 | 184 ms | 15808 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define uwu return
#define ALL(x) x.begin(), x.end()
#define fs first
#define sc second
vector <int> discrete;
const int SIZE = 4e5 + 5;
int direct[SIZE], dsu[SIZE];
int get_id(int i){
return lower_bound(ALL(discrete), i) - discrete.begin();
}
long long dist(int a, int b){
if(a > b) swap(a, b);
return discrete[b] - discrete[a];
}
int pa(int a){
if(dsu[a] < 0)
return a;
return dsu[a] = pa(dsu[a]);
컴파일 시 표준 에러 (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... |