Submission #40421832


Source Code Expand

Copy
#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)
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#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

Submission Time
Task A - Copy and Paste Graph
User zhoukangyang
Language C++ (GCC 9.2.1)
Score 300
Code Size 969 Byte
Status AC
Exec Time 10 ms
Memory 3620 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 40
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 02_smallM_00.txt, 02_smallM_01.txt, 02_smallM_02.txt, 02_smallM_03.txt, 02_smallM_04.txt, 03_largeM_00.txt, 03_largeM_01.txt, 03_largeM_02.txt, 03_largeM_03.txt, 03_largeM_04.txt, 04_dag_00.txt, 04_dag_01.txt, 04_dag_02.txt, 04_dag_03.txt, 04_dag_04.txt, 04_dag_05.txt, 04_dag_06.txt, 04_dag_07.txt, 04_dag_08.txt, 04_dag_09.txt, 05_path_00.txt, 05_path_01.txt, 05_path_02.txt, 05_path_03.txt, 06_minmax_00.txt, 06_minmax_01.txt, 06_minmax_02.txt, 06_minmax_03.txt, 06_minmax_04.txt, 06_minmax_05.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 10 ms 3548 KB
00_sample_01.txt AC 2 ms 3572 KB
01_rnd_00.txt AC 4 ms 3540 KB
01_rnd_01.txt AC 5 ms 3540 KB
01_rnd_02.txt AC 6 ms 3544 KB
01_rnd_03.txt AC 5 ms 3608 KB
01_rnd_04.txt AC 5 ms 3536 KB
01_rnd_05.txt AC 6 ms 3588 KB
01_rnd_06.txt AC 5 ms 3592 KB
01_rnd_07.txt AC 3 ms 3540 KB
02_smallM_00.txt AC 5 ms 3588 KB
02_smallM_01.txt AC 4 ms 3620 KB
02_smallM_02.txt AC 6 ms 3500 KB
02_smallM_03.txt AC 6 ms 3500 KB
02_smallM_04.txt AC 5 ms 3608 KB
03_largeM_00.txt AC 8 ms 3476 KB
03_largeM_01.txt AC 3 ms 3580 KB
03_largeM_02.txt AC 5 ms 3544 KB
03_largeM_03.txt AC 3 ms 3584 KB
03_largeM_04.txt AC 6 ms 3540 KB
04_dag_00.txt AC 5 ms 3532 KB
04_dag_01.txt AC 5 ms 3608 KB
04_dag_02.txt AC 5 ms 3480 KB
04_dag_03.txt AC 5 ms 3532 KB
04_dag_04.txt AC 5 ms 3588 KB
04_dag_05.txt AC 6 ms 3480 KB
04_dag_06.txt AC 5 ms 3536 KB
04_dag_07.txt AC 6 ms 3544 KB
04_dag_08.txt AC 6 ms 3532 KB
04_dag_09.txt AC 5 ms 3580 KB
05_path_00.txt AC 6 ms 3608 KB
05_path_01.txt AC 5 ms 3552 KB
05_path_02.txt AC 5 ms 3580 KB
05_path_03.txt AC 5 ms 3540 KB
06_minmax_00.txt AC 2 ms 3568 KB
06_minmax_01.txt AC 2 ms 3504 KB
06_minmax_02.txt AC 4 ms 3480 KB
06_minmax_03.txt AC 5 ms 3532 KB
06_minmax_04.txt AC 5 ms 3548 KB
06_minmax_05.txt AC 10 ms 3552 KB


2025-03-15 (Sat)
01:30:40 +00:00