# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086836 | peacebringer1667 | Commuter Pass (JOI18_commuter_pass) | C++17 | 262 ms | 21116 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 ll long long
#define ldb long double
#define fi first
#define se second
#define sza(a) (int)a.size()
#define pir pair<int,int>
#define pirll pair<ll,int>
using namespace std;
const int maxn = 1e5 + 5;
ll dist[maxn][2],dp[maxn],D[maxn][2];
bool mark[maxn];
vector <vector<pir>> vec(maxn);
void input(int n,int m){
while (m--){
int u,v,w;
cin >> u >> v >> w;
vec[u].push_back({v,w});
vec[v].push_back({u,w});
}
}
void dijkstra(int source,int n,int st){
for (int i = 1 ; i <= n ; i++) mark[i] = 0;
priority_queue <pirll,vector<pirll>,greater<pirll>> pq;
pq.push({0,source});
while (pq.size()){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |