Submission #704607

#	Time	Username	Problem	Language	Result	Execution time	Memory
704607		hoangnghiep	Toll (BOI17_toll)	C++14	100 / 100	243 ms	199304 KiB

toll

#include<bits/stdc++.h>
#define int long long
#define f first
#define s second
#define repeat(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define p push
#define pii pair<int,int>
#define piii pair<int,pair<int,int>>
#define vii vector<vector<int>>
#define vi vector<int>
//#define DEBUG
//#define multipletest
using namespace std;
const int LIM=5e4;
const int mod=1e9+7;
const int maxn=20;
const int inf=1e9;
int n,m,x,y,k,t,e,q,o;
int dx[8]={1,-1,0,0,-1,-1,1,1};
int dy[8]={0,0,-1,1,1,-1,1,-1};
char c;
string s;
int a[LIM+5],factorial[(1<<maxn)+5],inv_fact[(1<<maxn)+5];
bool notprime[LIM+5];
map<int,int> mp;
char grid[100+5][100+5];
int power(int a,int b){
   if(b==0) return 1;
    int t=power(a,b/2);
    t = t * t %mod;
    if(b%2==1) t = t * a %mod;
    return t;
}
struct matrix{
	int a[5][5];
	matrix(int x=inf){
		for(int i=0;i<5;++i){
			for(int j=0;j<5;++j){
				a[i][j]=x;
			}
		}
	}
	matrix operator *(const matrix & u){
		matrix ans;
		for(int i=0;i<5;++i){
			for(int j=0;j<5;++j){
				int res=inf;
				for(int k=0;k<5;++k){
					res = min(res,a[i][k] + u.a[k][j]);
				}
				ans.a[i][j]=res;
			}
		}
		return ans;
	}
};
bool check(int x,int y){
    if(x<=0 || x>n || y<=0 || y>m || grid[x][y]=='T'){
   return false;
     }
    return true;
}
class DSU{
	int *parent;
	int *rank;
	int *tot;
	public:
	DSU(int n){
		rank=new int[n+5];
		parent=new int[n+5];
		tot=new int [n+5];
		for(int i=0;i<n+5;i++){
			parent[i]=i;
			rank[i]=0;
			tot[i]=1;
		}
	}
	int find(int i){
		if(parent[i]==i){
			return i;
		}
		return parent[i]=find(parent[i]);
	}
	void unite(int u,int v){
		int i=find(u);
		int j=find(v);
		if(i!=j){
			if(rank[i]>rank[j]){
				parent[j]=i;
				tot[i]+=tot[j];
			}
			else if(rank[i]<rank[j]){
				parent[i]=j;
				tot[j]+=tot[i];
			}
			else{
				parent[j]=i;
				rank[i]++;
				tot[i]+=tot[j];
			}
		}
	}
	int total(int u){
	   return tot[u];
	}
};
void precal(int n){
	factorial[0]=1;
	inv_fact[0]=1;
    for (int i = 1; i <n; ++i)
	{
		factorial[i] = factorial[i - 1] * i % mod;
		inv_fact[i] = inv_fact[i - 1] * power(i, mod - 2) % mod;
	}
}
int choose(int n,int k){
	if(k<0 || k>n) return 0;
	return factorial[n] * inv_fact[n-k] % mod * inv_fact[k] %mod;
}
void Sieve(){
	notprime[0]=notprime[1]=true;
    for(int i=2;i<LIM+5;++i){
    	if(notprime[i]==false){
    	for(int j=i*i;j<LIM+5;j+=i){
    		notprime[j]=true;
		}
    }
	}
}
matrix up[20][LIM+5];
void solve(){
//Sieve();
//   precal();
    cin>>k>>n>>m>>o;
    for(int i=1;i<=m;++i){
    	int u,v,w;
    	cin>>u>>v>>w;
    	up[0][(u/k)].a[u%k][v%k]=w;
	}
	for(int i=1;((1<<i)<=n);++i){
		for(int j=0;j+(1<<i)-1<=n;++j){
			 up[i][j]=up[i-1][j] * up[i-1][j+(1<<(i-1))];
		}
	}
	for(int i=0;i<o;++i){
		int a,b;
		cin>>a>>b;
		matrix res;
//		cout<<a<<b<<endl;
		for(int i=0;i<5;++i){
			res.a[i][i]=0;
		}
		if(a==b){
			cout<<0<<endl;
		}
		int div1=(a/k),div2=(b/k);
		int dist=div2-div1;
		int temp=0;
	    while(dist>0){
	    	if(dist%2==1) {
			res = res * up[temp][div1];
			div1 = div1 + (1<<temp);
		   }
		   temp++;
		   dist>>=1;
		}
		if(res.a[a%k][b%k]==inf) cout<<-1<<endl;
		else cout<<res.a[a%k][b%k]<<endl;
	}
}
signed main(){
  // freopen(".inp","r",stdin);
  // freopen(".out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	int test;
	test=1;
	#ifdef multipletest
	cin>>test;
	#endif
	while(test--){
        solve();
        #ifdef DEBUG
		cerr << "Runtime is: " << clock() * 1.0 / CLOCKS_PER_SEC << endl;
	    #endif
	}
}

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