# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851281 | kderylo | Toll (BOI17_toll) | C++17 | 99 ms | 21640 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>
using namespace std;
const int stala=5e4+10;
int tab[stala][6][16];
long long pom[10][16];
void prepare(int ile,int k)
{
for(int z=1;z<16;z++){
for(int i=0;i<ile;i++){
int pocz=i/k;
int sr=pocz+(1<<(z-1));
int kon=pocz+(1<<z);
if(kon*k<=ile){
int sr_x=min(sr*k,ile-1);
int sr_y=min((sr+1)*k-1,ile-1);
int kon_x=min(kon*k,ile-1);
int kon_y=min((kon+1)*k-1,ile-1);
for(int x=sr_x;x<=sr_y;x++){
for(int y=kon_x;y<=kon_y;y++){
tab[i][y%k][z]=min(tab[i][y%k][z],tab[i][x%k][z-1]+tab[x][y%k][z-1]);
}
}
}
}
}
}
int find_path(int x,int y,int k,int ile)
{
for(int i=0;i<k;i++){
for(int j=1;j<16;j++){
# | 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... |