# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51970 | TadijaSebez | Commuter Pass (JOI18_commuter_pass) | C++11 | 1352 ms | 149040 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 <stdio.h>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
const int N=100050;
vector<pair<int,int> > E[N];
vector<int> go[N];
ll dist[N],sol[N][3];
const ll inf=1e18;
bool ok[N];
bool mark[N];
void DFS(int u)
{
mark[u]=1;
for(int i=0;i<go[u].size();i++)
{
int v=go[u][i];
if(!mark[v]) DFS(v);
}
}
void Dijkstra1(int n, int s, int t)
{
int i;
for(i=1;i<=n;i++) dist[i]=inf,go[i].clear(),mark[i]=0;
priority_queue<pair<ll,int> > pq;
dist[s]=0;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |