# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
644636 | 2022-09-25T04:54:31 Z | guagua0407 | Toll (BOI17_toll) | C++17 | 266 ms | 99144 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define F first #define S second #define all(x) x.begin(),x.end() #define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } int k,n,m,o; const int mxn=5e4+4; int dp[mxn][20][5][5]; int ans[5][5]; int tmp[5][5]; void ckmin(int a[5][5],int b[5][5],int c[5][5]){ for(int x=0;x<5;x++){ for(int y=0;y<5;y++){ for(int z=0;z<5;z++){ a[x][z]=min(a[x][z],b[x][y]+c[y][z]); } } } } int main() {_ //setIO("wayne"); cin>>k>>n>>m>>o; memset(dp,0x3f,sizeof dp); for(int i=0;i<m;i++){ int a,b,t; cin>>a>>b>>t; dp[a/k][0][a%k][b%k]=t; } for(int j=1;j<20;j++){ for(int i=0;i + (1 << j) < (n + k - 1) / k;i++){ ckmin(dp[i][j],dp[i][j-1],dp[i+(1<<j-1)][j-1]); } } for(int i=0;i<o;i++){ int a,b; cin>>a>>b; int node=a/k; int length=(b/k)-(a/k); memset(ans,0x3f,sizeof ans); for(int i=0;i<5;i++){ ans[i][i]=0; } //cout<<length<<'\n'; for(int i=0;i<20;i++){ if(length&(1<<i)){ memset(tmp,0x3f,sizeof tmp); ckmin(tmp,ans,dp[node][i]); memcpy(ans,tmp,sizeof ans); } } cout<<(ans[a%k][b%k]==0x3f3f3f3f?-1:ans[a%k][b%k])<<'\n'; } return 0; } //maybe its multiset not set
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 266 ms | 99144 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 147 ms | 99092 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 98124 KB | Output is correct |
2 | Incorrect | 40 ms | 98080 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 98124 KB | Output is correct |
2 | Incorrect | 40 ms | 98080 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 266 ms | 99144 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |