oj.uz

답안 #912303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912303 2024-01-19T09:50:15 Z imarn Toll (BOI17_toll) C++14
7 / 100
 125 ms 166748 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
using namespace std;
ll dp[50001][17][5][5];int k;
void pre(int i,int j,int ii,int jj,int iii,int jjj){
    for(int x=0;x<k;x++){
        for(int y=0;y<k;y++){
            for(int z=0;z<k;z++){
                dp[i][j][x][y]=min(dp[i][j][x][y],dp[ii][jj][x][z]+dp[iii][jjj][z][y]);
            }
        }
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m,o;cin>>k>>n>>m>>o;
    for(int i=0;i<50001;i++)for(int j=0;j<17;j++)for(int t=0;t<5;t++)for(int l=0;l<5;l++)dp[i][j][t][l]=1e15;
    while(m--){
        int a,b,t;cin>>a>>b>>t;
        dp[a/k][0][a%k][b%k]=t;
    }
    for(int j=1;j<17;j++){
        for(int i=0;i<(n+k-1)/k;i++){
            if(i+(1<<j)<50001)pre(i,j,i,j-1,i+(1<<j-1),j-1);
        }
    }ll ans[5]={0},tmp[5]={0};
    while(o--){
        int a,b;cin>>a>>b;
        for(int i=0;i<5;i++)ans[i]=0;
        int cur=a/k,dest=b/k;
        for(int i=16;i>=0;i--){
            if(cur+(1<<i)<=dest){
                for(int x=0;x<k;x++)tmp[x]=1e15;
                for(int y=0;y<k;y++){
                    for(int z=0;z<k;z++){
                        tmp[y]=min(tmp[y],ans[z]+dp[cur][i][z][y]);
                    }
                }for(int x=0;x<k;x++)ans[x]=tmp[x];
                cur+=(1<<i);
            }
        }cout<<(ans[b%k]==1e15?-1:ans[b%k])<<'\n';
    }
}

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:30:52: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   30 |             if(i+(1<<j)<50001)pre(i,j,i,j-1,i+(1<<j-1),j-1);
      |                                                   ~^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 166748 KB Output is correct
2 Correct 31 ms 166736 KB Output is correct
3 Correct 32 ms 166740 KB Output is correct
4 Correct 31 ms 166740 KB Output is correct
5 Correct 31 ms 166740 KB Output is correct
6 Correct 32 ms 166588 KB Output is correct
7 Correct 32 ms 166572 KB Output is correct
8 Correct 69 ms 166740 KB Output is correct
9 Correct 66 ms 166588 KB Output is correct
10 Correct 47 ms 166736 KB Output is correct

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 166572 KB Output is correct
2 Incorrect 32 ms 166748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 166572 KB Output is correct
2 Incorrect 32 ms 166748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 166748 KB Output is correct
2 Correct 31 ms 166736 KB Output is correct
3 Correct 32 ms 166740 KB Output is correct
4 Correct 31 ms 166740 KB Output is correct
5 Correct 31 ms 166740 KB Output is correct
6 Correct 32 ms 166588 KB Output is correct
7 Correct 32 ms 166572 KB Output is correct
8 Correct 69 ms 166740 KB Output is correct
9 Correct 66 ms 166588 KB Output is correct
10 Correct 47 ms 166736 KB Output is correct
11 Incorrect 125 ms 166740 KB Output isn't correct
12 Halted 0 ms 0 KB -