Submission #40421832

---

Source Code Expand

#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 107;
ll n, k;
int G[N][N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> k;
	L(i, 1, n) {
		L(j, 1, n) {
			cin >> G[i][j];
			if(G[i][j] == 0) 
				G[i][j] = 1e9;
		}
	}
	L(k, 1, n) 
		L(i, 1, n) 
			L(j, 1, n) 
				G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
	int q;
	cin >> q;
	while(q--) {
		ll x, y;
		cin >> x >> y;
		x = (x - 1) % n + 1;
		y = (y - 1) % n + 1;
		if(G[x][y] > n) 
			cout << -1 << '\n';
		else 
			cout << G[x][y] << "\n";
	}
	return 0;
}

/*
every time we add 
sum % n = 0;-
sum += n * (n + 1) / 2

n * (n - 1) / 2 % n
*/

Submission Info

Judge Result