oj.uz

답안 #487901

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
487901 2021-11-17T01:49:58 Z maks007 Trampoline (info1cup20_trampoline) C++17
23 / 100
 2000 ms 1048580 KB 
#include <bits/stdc++.h>

using namespace std;

void solve() {
	int n, m, green;
	cin >> n >> m >> green;
	const int N = 2500 * 2500;
	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;
}

Compilation message

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.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 632 ms 173016 KB 200 token(s): yes count is 21, no count is 179
2 Correct 689 ms 172776 KB 200 token(s): yes count is 70, no count is 130
3 Correct 613 ms 173128 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2100 ms 416336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 364 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 366 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 387 ms 1048580 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -