algorithmStudy/11265.cpp at master · judy5050/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
//
//  11265.cpp
//  algo
//
//  Created by 박효정 on 2021/10/04.
//

#include <iostream>
#include <algorithm>
#include <vector>
#define INF 2147000000
using namespace std;

long long graph[501][501];
int n,m;
void init(){
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(i!=j){
                graph[i][j]=INF;
            }else{
                graph[i][j]=0;
            }

        }
    }


}

int main(){

    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);


    cin>>n>>m;

    init();


    //input
    for (int i=0;i<n; i++) {
        for(int j=0;j<n;j++){
            cin>>graph[i][j];
        }
    }

    for(int k=0;k<n;k++){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                graph[i][j]=min(graph[i][j],graph[i][k]+graph[k][j]);
            }
        }
    }


    for(int i=0;i<m;i++){
        int a,b;
        long long c;
        cin>>a>>b>>c;
        if(graph[a-1][b-1]<=c){
            cout<<"Enjoy other party"<<"\n";
        }else{
            cout<<"Stay here"<<"\n";
        }
    }


    return 0;
}