https://www.acmicpc.net/problem/16397코드#include #include #include using namespace std;#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);#define MAX 99999int n, t, g, tmp;bool visit[MAX];string s;queue> q;void bfs() { while (!q.empty()) { int now = q.front().first; int cnt = q.front().second; q.pop(); if (cnt > t) continue; if (now == g) { cout > n >> t >> g; q.push({ n, 0 }); visi..
