# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
182152 | Ruxandra985 | Toll (BOI17_toll) | C++14 | 1279 ms | 173228 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 INF 2000000000
using namespace std;
map <int,int> rmq[20][50010];
map <int , pair <int,int> > mp;
int lg[50010] , step[50010];
deque <pair <int,int> > dq;
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int k , n , m , o , x , y, z, i , j , p , len , elem , nod , nr , nrr;
fscanf (fin,"%d%d%d%d",&k,&n,&m,&o);
for (i=1;i<=m;i++){
fscanf (fin,"%d%d%d",&x,&y,&z);
rmq[0][min(x , y)][max(x , y)] = z;
}
for (i=2;i<=n;i++)
lg[i] = 1 + lg[i/2];
for (p=1;(1<<p) <= n/k;p++){
for (i=0;i<=n;i++){
if (i / k + (1 << p) <= n / k){ /// e ok
for (j = (i / k + (1 << p)) * k ; j < (i / k + (1 << p) + 1) * k; j++){
for (x = (i / k + (1 << (p-1))) * k ; x < (i / k + (1 << (p-1)) + 1) * k; x++){
if (rmq[p-1][i][x] && rmq[p-1][x][j]){
if (!rmq[p][i][j])
rmq[p][i][j] = rmq[p-1][i][x] + rmq[p-1][x][j];
else rmq[p][i][j] = min(rmq[p][i][j] , rmq[p-1][i][x] + rmq[p-1][x][j]);
}
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... |