# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498509 | gratus907 | 주유소 (KOI16_gas) | C++17 | 2076 ms | 55272 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 <iostream>
#include <vector>
#include <queue>
#pragma GCC optimize("Ofast")
#define ll long long
#define eps 1e-7
#define all(x) ((x).begin()),((x).end())
#define usecppio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
using pii = pair<int, int>;
const ll INF = 987654321987654321;
const int MX = 2625;
struct Edge {
int src, dst, w;
bool operator<(const Edge &p) const {
return w > p.w;
}
};
int fuel[MX];
ll cost[MX * MX];
vector <Edge> G[MX];
void dijkstra(ll dist[], int start, vector<Edge> graph[])
{
fill(dist,dist+MX*MX,INF);
dist[start*2501+fuel[start]] = 0;
priority_queue<Edge> pq;
pq.push({0, start,0});
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |