# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154049 | mhy908 | 날다람쥐 (JOI14_ho_t4) | C++14 | 2052 ms | 17404 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>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define llinf 8987654321987654321
#define inf 1987654321
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
int h[100010];
LL dist[100010];
vector<int> link[100010], c[100010];
int n, m, x;
priority_queue<pair<LL, int> > q;
int main(){
scanf("%d %d %d",&n, &m, &x);
for(int i=1; i<=n; i++) scanf("%d", &h[i]);
for(int i=1; i<=m; i++){
int a, b, t;
scanf("%d %d %d", &a, &b, &t);
link[a].pb(b);
c[a].pb(t);
link[b].pb(a);
c[b].pb(t);
}
for(int i=1; i<=n; i++)dist[i]=-llinf;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |