# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935026 | Hanksburger | Toll (BOI17_toll) | C++17 | 427 ms | 123636 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>
using namespace std;
vector<pair<int, int> > adj[50005], rev[50005];
map<pair<int, int>, int> mp;
int dist[50005];
void recur(int l, int r, int c)
{
int mid=(l+r)/2;
for (int i=c*mid; i<c*(mid+1); i++)
{
for (int j=c*l; j<c*(r+1); j++)
dist[j]=1e9;
dist[i]=0;
for (int j=c*mid-1; j>=c*l; j--)
{
for (int k=0; k<adj[j].size(); k++)
dist[j]=min(dist[j], dist[adj[j][k].first]+adj[j][k].second);
mp[{j, i}]=dist[j];
}
for (int j=c*(mid+1); j<c*(r+1); j++)
{
for (int k=0; k<rev[j].size(); k++)
dist[j]=min(dist[j], dist[rev[j][k].first]+rev[j][k].second);
mp[{i, j}]=dist[j];
}
}
if (l+2<=mid)
recur(l, mid-1, c);
if (mid+2<=r)
recur(mid+1, r, c);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |