rt，题链link

我的代码

//20240117luoguB3702 [语言月赛202301] 华小科的旅行开始了 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;

struct Map {
	int x, y;
} ma[N][N];

int main() {
	int n, m, sx, sy;
	scanf("%d %d %d %d", &n, &m, &sx, &sy);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++)
			scanf("%d %d", &ma[i][j].x, &ma[i][j].y);
	}
	int x=sx,y=sy;
	while (sx && sy) {
		printf("%d %d\n", sx, sy);
		int x = sx, y = sy;
		sx = ma[x][y].x, sy = ma[x][y].y;
	}
	return 0;
}