Submission #1087270

#TimeUsernameProblemLanguageResultExecution timeMemory
1087270PieArmyToll (BOI17_toll)C++17
100 / 100
76 ms19276 KiB
int pie(int army){return (1<<army);} #include <bits/stdc++.h> #define endl '\n' const int sonsuz=1000000005; using namespace std; int k,n,m,q; int nex[50001][16][5]; int main(){ ios_base::sync_with_stdio(false);cin.tie(NULL); cin>>k>>n>>m>>q; for(int i=0;i<n;i++){ for(int j=0;j<16;j++){ for(int l=0;l<k;l++){ nex[i][j][l]=sonsuz; } } } for(int i=1;i<=m;i++){ int a,b,t;cin>>a>>b>>t; nex[a][0][b%k]=min(t,nex[a][0][b%k]); } for(int i=1;i<16;i++){ for(int x=0;x<n;x++){ for(int a=0;a<k;a++){ for(int b=0;b<k;b++){ if(nex[x][i-1][a]==sonsuz)break; int y=((x/k)+pie(i-1))*k+a; if(y>=n)break; if(nex[y][i-1][b]==sonsuz)continue; nex[x][i][b]=min(nex[x][i][b],nex[x][i-1][a]+nex[y][i-1][b]); } } } } while(q--){ int yunuy,suayp;cin>>yunuy>>suayp; int pos=yunuy/k,tar=suayp/k; int ans[k];for(int &x:ans)x=sonsuz; ans[yunuy%k]=0; for(int i=0;i<16;i++){ if((tar-pos)&pie(i)){ int yeni[k];for(int &x:yeni)x=sonsuz; for(int a=0;a<k;a++){ if(ans[a]==sonsuz)continue; for(int b=0;b<k;b++){ if(nex[pos*k+a][i][b]==sonsuz)continue; yeni[b]=min(yeni[b],ans[a]+nex[pos*k+a][i][b]); } } for(int j=0;j<k;j++){ ans[j]=yeni[j]; } pos+=pie(i); } } if(ans[suayp%k]==sonsuz){ cout<<-1; } else cout<<ans[suayp%k]; cout<<endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...