문제: 21736번: 헌내기는 친구가 필요해 #include #include #include using namespace std;vector> visit(600, vector(600));int dx[4] = { 1, 0, -1, 0 };int dy[4] = { 0, 1, 0, -1 };int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; pair startPos; vector> campus(n); for (int i = 0; i (m); string input; cin >> input; for (int j = 0; j > nexts; nexts...