# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1137415 | gyg | Roller Coaster Railroad (IOI16_railroad) | C++20 | 275 ms | 33212 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define arr array
#define vec vector
#define pii pair<int, int>
#define fir first
#define sec second
#define ub upper_bound
const int N = 2e5 + 5, INF = 1e18;
int n;
arr<int, N> s, t;
struct Dsj {
arr<int, N> prnt;
void intl() {
for (int u = 0; u <= n; u++) prnt[u] = u;
}
int pr(int u) {
return (prnt[u] == u) ? u : prnt[u] = pr(prnt[u]);
}
void mrg(int u, int v) {
u = pr(u), v = pr(v);
assert(u != v);
prnt[v] = u;
}
} dsj;
set<pii> s_st, t_st;
컴파일 시 표준 에러 (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... |