Submission #932412

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
932412	2024-02-23T09:49:07 Z	Whisper	Alias (COCI21_alias)	C++17	40 / 70	1000 ms	20500 KB

alias

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e3 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }

map<string, vector<pair<string, int>>> adj;
int numNode, numEdge, numQuery;
unordered_map<string, int> vis;
int ans = LINF;
void go(string &u, string &fin, int time = 0){
    vis[u] = 1;

    priority_queue<pair<string, int>, vector<pair<string, int>>, greater<pair<string, int>>> q;
    q.emplace(u, 0);
    while (!q.empty()){
        pair<string, int> x = q.top(); q.pop();
        string u = x.first; int c = x.second;
        if (u == fin){
            ans = c; break;
        }
        vis[u] = 1;
        for (pair<string, int>& x : adj[u]){
            string v = x.first; int w = x.second;
            if (!vis.count(v)){
                q.emplace(v, c + w);
            }
        }
    }
}
void Whisper(){
    cin >> numNode >> numEdge;
    for (int i = 1; i <= numEdge; ++i){
        string u, v; int c;
        cin >> u >> v >> c;
        adj[u].push_back({v, c});
    }
    cin >> numQuery;
    for (int i = 1; i <= numQuery; ++i){
        string u, v; cin >> u >> v;
        go(u, v);
        if(ans == LINF) cout << "Roger\n";
        else cout << ans << '\n';
        vis.clear();
        ans = LINF;
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1

40.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Incorrect	1 ms	348 KB	Output isn't correct
3	Execution timed out	1049 ms	20500 KB	Time limit exceeded
4	Execution timed out	1048 ms	2368 KB	Time limit exceeded
5	Correct	4 ms	600 KB	Output is correct
6	Correct	4 ms	604 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct