oj.uz

답안 #486447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
486447 2021-11-11T17:02:24 Z davi_bart Alias (COCI21_alias) C++17
20 / 70
 121 ms 592 KB 
#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> > 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';
    }
}

Subtask #1
20.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Incorrect 94 ms 588 KB Output isn't correct
4 Incorrect 121 ms 592 KB Output isn't correct
5 Correct 5 ms 572 KB Output is correct
6 Incorrect 5 ms 460 KB Output isn't correct
7 Correct 3 ms 588 KB Output is correct