# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480937 | peti1234 | Race (IOI11_race) | C++17 | 522 ms | 101504 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.
#include <bits/stdc++.h>
using namespace std;
const int c=200005;
int szint[c], ki[c];
long long dist[c], cel, ans=c;
map<long long, long long> m[c];
vector<pair<int, int> > sz[c];
bool v[c];
void unio(int a, int b) {
int aa=ki[a], bb=ki[b], sa=m[aa].size(), sb=m[bb].size();
long long ert=cel+2*dist[a];
if (sa>=sb) {
for (auto p:m[bb]) {
long long fi=p.first, se=p.second, inv=ert-fi;
if (m[aa].find(inv)!=m[aa].end()) {
ans=min(ans, se+m[aa][inv]-2*szint[a]);
}
}
for (auto p:m[bb]) {
long long fi=p.first, se=p.second;
if (m[aa].find(fi)!=m[aa].end()) {
m[aa][fi]=min(m[aa][fi], se);
} else {
m[aa][fi]=se;
}
}
} else {
ki[a]=bb;
# | 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... |