# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
239233 | osaaateiasavtnl | Teleporters (IOI08_teleporters) | C++14 | 916 ms | 50144 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int C = 2e6+7;
int who[C];
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n, m;
cin >> n >> m;
vector <ii> a(n);
vector <int> c = {0, 2 * 1000 * 1000 + 1};
for (int i = 0; i < n; ++i) {
cin >> a[i].f >> a[i].s;
c.app(a[i].f);
c.app(a[i].s);
who[a[i].f] = i;
who[a[i].s] = i;
}
sort(all(c));
int sz = c.size() - 1;
vector <int> to(sz, -1);
for (int i = 0; i + 2 < c.size(); ++i) {
int u = who[c[i+1]];
int x = a[u].f^a[u].s^c[i+1];
to[i] = lower_bound(all(c), x) - c.begin();
}
int ans = 0;
vector <int> len;
vector <bool> used(sz);
for (int i = 0; i < sz; ++i) {
if (!used[i]) {
int u = i;
int l = 0;
while (u != -1 && !used[u]) {
used[u] = 1;
++l;
u = to[u];
}
if (u == -1) {
ans += l;
}
else {
len.app(l);
}
}
}
sort(all(len));
reverse(all(len));
#ifdef HOME
cout << "len : ";
for (auto e : len)
cout << e << ' ';
cout << endl;
#endif
int ptr = 0;
for (int i = 0; i < m; ++i) {
if (ptr < len.size()) {
ans += len[ptr] + 2;
++ptr;
}
else {
++ans;
len.app(1);
}
}
cout << ans - 1 << endl;
}
컴파일 시 표준 에러 (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... |