| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 486448 | davi_bart | Alias (COCI21_alias) | C++14 | 103 ms | 516 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
map<string, vector<pair<string, int>>> v;
string ans(string a, string b) {
    priority_queue<pair<int, string>, vector<pair<int, string>>, greater<pair<int, string>>> q;
    set<string> vis;
    q.push({0, a});
    while (!q.empty()) {
        auto [d, pos] = q.top();
        q.pop();
        if (vis.count(pos)) continue;
        vis.insert(pos);
        if (pos == b) return to_string(d);
        for (auto [x, y] : v[pos]) {
            q.push({d + y, x});
        }
    }
    return "Roger";
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, M;
    cin >> N >> M;
    for (int i = 0; i < M; i++) {
        string a, b;
        int c;
        cin >> a >> b >> c;
        v[a].pb({b, c});
    }
    int Q;
    cin >> Q;
    while (Q--) {
        string a, b;
        cin >> a >> b;
        cout << ans(a, b) << '\n';
    }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
