Submission #1293101

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293101		EkinOnal	Toll (BOI17_toll)	C++20	100 / 100	404 ms	221308 KiB

toll

//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
 
#define MAX 100005
#define pb push_back
// #define mp make_pair 
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>> 
const int mod = 1e9+7;
const int INF = 1e18;
// myMap.begin()->first :  key
// myMap.begin()->second : value
 
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;b>>=1;ans%=mod;a%=mod;}return ans%mod;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
int sum(int a,int b){return ((a%mod)+(b%mod))%mod;}
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
// typedef
// tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_multiset;

vpii adj[MAX];
int dp[MAX][22][5][5];

void solve(){ 
	int k,n,m,q; cin>>k>>n>>m>>q;

	for(int i=0;i<=n;i++){
		for(int j=0;j<=22;j++){
			for(int k=0;k<=5;k++){
				for(int o=0;o<=5;o++) dp[i][j][k][o]=INF;
			}
		}
	}

	for(int i=1;i<=m;i++){
		int a,b,c; cin>>a>>b>>c;
		adj[a].pb({b,c}); 

		pii u={a/k,a%k}, v={b/k,b%k};
		dp[u.f][0][u.s][v.s]=c;
	}	

	for(int i=1;i<=__lg(n);i++){  
		for(int d1=0;d1<n;d1++){
			for(int x=0;x<5;x++){
				for(int y=0;y<5;y++){
					for(int ara=0;ara<5;ara++){
						dp[d1][i][x][y]=min(dp[d1][i][x][y], dp[d1][i-1][x][ara]+dp[d1+(1ll<<(i-1))][i-1][ara][y] );
					}
				}
			}
		}
	}

	int ans[5][5],tmp[5][5];
	while(q--){
		int a,b; cin>>a>>b;

		memset(ans,0x3f,sizeof(ans));
		for(int i=0;i<5;i++) ans[i][i]=0;

		pii u={a/k,a%k}, v={b/k,b%k};
		int fark=v.f-u.f;

		for(int i=__lg(n);i>=0;i--){
			if(!(fark&(1ll<<i))) continue;
			memset(tmp,0x3f,sizeof(tmp));

			for(int x=0;x<5;x++){
				for(int y=0;y<5;y++){
					for(int ara=0;ara<5;ara++){
						tmp[x][y]=min(tmp[x][y], ans[x][ara]+dp[u.f][i][ara][y] );
					}
				}
			}
			memcpy(ans,tmp,sizeof(tmp));
			u.f+=(1ll<<i);
		}	
		cout<<(ans[a%k][b%k]<1e15?ans[a%k][b%k]:-1)<<endl;	
	}

		
}	
	
int32_t main(/*int32_t argc, char* argv[]*/){
	std::ios_base::sync_with_stdio(0); std::cin.tie(0);	

	// freopen("disconnected.in", "r", stdin);
	// freopen("disconnected.out", "w", stdout);

	int t=1;
	// cin >> t;
	while (t--) solve();
 	
	return 0;
}	

Compilation message (stderr)

toll.cpp: In function 'void solve()':
toll.cpp:41:69: warning: iteration 5 invokes undefined behavior [-Waggressive-loop-optimizations]
   41 |                                 for(int o=0;o<=5;o++) dp[i][j][k][o]=INF;
      |                                                       ~~~~~~~~~~~~~~^~~~
toll.cpp:41:46: note: within this loop
   41 |                                 for(int o=0;o<=5;o++) dp[i][j][k][o]=INF;
      |                                             ~^~~
toll.cpp:41:69: warning: iteration 5 invokes undefined behavior [-Waggressive-loop-optimizations]
   41 |                                 for(int o=0;o<=5;o++) dp[i][j][k][o]=INF;
      |                                                       ~~~~~~~~~~~~~~^~~~
toll.cpp:40:38: note: within this loop
   40 |                         for(int k=0;k<=5;k++){
      |                                     ~^~~

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44