제출 #487902

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
487902		maks007	Trampoline (info1cup20_trampoline)	C++14	23 / 100	2116 ms	416220 KiB

trampoline

#include <bits/stdc++.h>

using namespace std;

void solve() {
	int n, m, green;
	cin >> n >> m >> green;
	const int N = n * m;
	vector <int> used(N);
	vector <vector <int>> g(N);
	pair <int, int> mp[n][m];

	function <void(int)> dfs=[&](int v) {
		used[v] = 1;
	//	cout << v << " ";
		for(int i = 0; i < g[v].size(); i ++) {
			if (!used[g[v][i]]) dfs(g[v][i]);
		}
	};

	int cnt = 0;

	for(int i = 0; i < n; i ++) {
		for(int j = 0; j < m; j ++) {
			mp[i][j].first = cnt ++;
			mp[i][j].second = 0;
		}
	} 

	for(int i = 0; i < green; i ++) {
		int x, y;
		cin >> x >> y;
 		x --;
 		y --;
 		mp[x][y].second = 1;
	}

	for(int i = 0; i < n; i ++) {
		 for(int j = 0; j < m; j ++) {
		 	if(j != m - 1)
		 	g[mp[i][j].first].push_back(mp[i][j+1].first);
		 	if(i != n - 1)
		 	if(mp[i][j].second == 1) g[mp[i][j].first].push_back(mp[i+1][j].first);
		 }
	}
	int q;
	cin >> q;
	while(q --) {
		pair <int, int> start, end;
		cin >> start.first >> start.second;
		cin >> end.first >> end.second;
		end.first --;
		end.second --;
		start.first --;
		start.second --;
		for(int i = 0; i < used.size(); i ++) used[i] = 0;
		dfs(mp[start.first][start.second].first);
		if(used[mp[end.first][end.second].first]) cout << "Yes\n";
		else cout << "No\n";
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int Q = 1;
	//cin >> Q;
	while (Q --) {
		solve();
	}
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

trampoline.cpp: In lambda function:
trampoline.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   for(int i = 0; i < g[v].size(); i ++) {
      |                  ~~^~~~~~~~~~~~~
trampoline.cpp: In function 'void solve()':
trampoline.cpp:56:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for(int i = 0; i < used.size(); i ++) used[i] = 0;
      |                  ~~^~~~~~~~~~~~~

• Subtask 1: 23 / 23
• Subtask 2: 0 / 20
• Subtask 3: 0 / 11
• Subtask 4: 0 / 19
• Subtask 5: 0 / 27