133822025-01-07 18:20:41PajerLeviRácsháló gráfcpp17Wrong answer 0/508ms564 KiB
#include<bits/stdc++.h>

using namespace std;

int main(){
	int n, m, k;
	cin >> n >> m >> k;
	vector<vector<int>> d(n*m, vector<int>(n*m));
	for(int i=0;i<n*m;i++){
		for(int j=0;j<n*m;j++){
			d[i][j]=abs(i%m-j%m)+abs(i/m-j/m);
		}
	}
	for(int h=0;h<k;h++){
		int u, v;
		cin >> u >> v;
		u--, v--;
		int newMax=INT_MIN;
		for(int i=0;i<n*m;i++){
			for(int j=0;j<n*m;j++){
				d[i][j]=min(d[i][j], min(d[j][u]+d[i][v], d[i][u]+d[v][j])+1);
				newMax=max(newMax, d[i][j]);
			}
		}
		cout << newMax;
	}
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/08ms564 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms500 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Wrong answer0/21ms316 KiB
12Wrong answer0/23ms564 KiB
13Wrong answer0/34ms316 KiB
14Wrong answer0/32ms320 KiB
15Wrong answer0/34ms316 KiB
16Wrong answer0/31ms408 KiB
17Wrong answer0/34ms316 KiB
18Wrong answer0/32ms316 KiB
19Wrong answer0/31ms316 KiB
20Wrong answer0/31ms316 KiB
21Wrong answer0/32ms316 KiB
22Wrong answer0/38ms564 KiB