# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851697 | chuongdan | Commuter Pass (JOI18_commuter_pass) | C++14 | 225 ms | 81276 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 N 1000000
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long
#define rep(i, l, r) for(int i = l; i <= r; i++)
#define reprev(i, l, r) for(int i = l; i >= r; i--)
using namespace std;
typedef pair<int,int> i2;
typedef pair<i2,int> i3;
typedef pair<i2, i2> i4;
const int INF = 1e18;
const int MOD = 1e9 + 7;
int n, m, s, t, x, y;
int dp[N+5][2], dpu[N+5];
i3 edge[N+5];
vector<i2> g[N+5], g2[N+5];
void dijkstra(int start, int oper){
rep(i, 1, n) dp[i][oper] = INF;
priority_queue<i2, vector<i2>, greater<i2>> heap;
dp[start][oper] = 0;
heap.push(mp(0, start));
while (heap.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... |