oj.uz

답안 #851279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851279 2023-09-19T09:43:10 Z kderylo Toll (BOI17_toll) C++17
0 / 100
 91 ms 20816 KB 
#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);
                int sr_y=min((sr+1)*k-1,ile);
                int kon_x=min(kon*k,ile);
                int kon_y=min((kon+1)*k-1,ile);
                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++){
            pom[i][j]=0;
        }
    }
    int group_x=x/k;
    int group_y=y/k;
    if(group_x>=group_y){
        return -1;
    }
    int roznica=group_y-group_x;
    int l=0;
    for(int i=15;i>=0;i--){
        if((roznica&(1<<i))>0){
            l++;
            if(l==1){
                for(int j=0;j<k;j++){
                    pom[j][l]=tab[x][j][i];
                }
                group_x+=(1<<i);
            }
            else{
                int pocz_x=min(group_x*k,ile);
                int pocz_y=min((group_x+1)*k-1,ile);
                int kon_x=min(group_y*k,ile);
                int kon_y=min((group_y+1)*k-1,ile);
                for(int x=pocz_x;x<=pocz_y;x++){
                    for(int y=kon_x;y<=kon_y;y++){
                        pom[y%k][l]=min(pom[y%k][l],pom[x%k][l-1]+tab[x][y%k][i]);
                    }
                }
                group_x+=(1<<i);
            }
        }
    }
    if(pom[y%k][l]<1e9){
        return pom[y%k][l];
    }
    else{
        return -1;
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int k,n,m,o;
    cin>>k>>n>>m>>o;
    for(int i=0;i<=n;i++){
        for(int j=0;j<k;j++){
            for(int z=0;z<16;z++){
                tab[i][j][z]=1e9;
            }
        }
    }
    for(int i=1;i<=m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        tab[a][b%k][0]=c;
    }
    prepare(n,k);
    for(int i=1;i<=o;i++){
        int a,b;
        cin>>a>>b;
        cout<<find_path(a,b,k,n)<<"\n";
    }

    return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 20156 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 91 ms 20816 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 20156 KB Output isn't correct
2 Halted 0 ms 0 KB -