답안 #892869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892869 2023-12-26T05:55:13 Z shoryu386 Trampoline (info1cup20_trampoline) C++17
23 / 100
2000 ms 143612 KB
#include <bits/stdc++.h>
using namespace std;

#define int long long

#define MAXN 600007
vector<int> adj[MAXN];
bool vis[MAXN];

void dfs(int u) {
	for(int v: adj[u]) {
		if(!vis[v]) {
			vis[v] = 1;
			dfs(v);
		}
	}
}


main(){
	int r, c, n; cin >> r >> c >> n;
	
	//r and c are useless lmao
	int N = 0;
	map<int, set< pair<int, bool> >> importantPts; int a, b;
	for (int x = 0; x < n; x++){
		cin >> a >> b;
		importantPts[a].insert({b, 1}); //1 indicating green trampoline
		importantPts[a+1].insert({b, 0});
		N++; N++;
	}
	
	int q; cin >> q;
	pair<int, int> starts[q], ends[q]; 
	for (int x = 0; x < q; x++){
		cin >> starts[x].first >> starts[x].second >> ends[x].first >> ends[x].second;
		
		importantPts[ends[x].first].insert({ends[x].second, 0});
		N++;
	}

	map<pair<int, int>, int> coordToNode;
	pair<int, int> hmm[N];
	
	int cnt = 0;
	for (auto y : importantPts){
		for (auto z : y.second){
			coordToNode[{y.first, z.first}] = cnt;
			hmm[cnt] = {y.first, z.first};
			cnt++;
		}
	}
	
	for (auto y : importantPts){ //gen DAG
	
		pair<int, int> lastCoords = {-1, -1};
	
		for (auto z : y.second){
			if (lastCoords.first != -1) adj[coordToNode[lastCoords]].push_back(coordToNode[{y.first, z.first}]);
			
			if (z.second){
				adj[coordToNode[{y.first, z.first}]].push_back(coordToNode[{y.first+1, z.first}]);
			}
			lastCoords = {y.first, z.first};
		}
	}
	
	for (int x = 0; x < q; x++){
		auto startTramp = importantPts[starts[x].first].lower_bound({starts[x].second, 0});
		
		if (startTramp == importantPts[starts[x].first].end()){
			cout << "No\n"; continue;
		}
		
		int startF = starts[x].first, startS = startTramp->first;
		
		memset(vis, 0, sizeof(vis));
		dfs(coordToNode[{startF, startS}]);
		if (vis[coordToNode[{ends[x].first, ends[x].second}]]){
			cout << "Yes\n";
		}
		else cout << "No\n";
	}
	
	
	
}

Compilation message

trampoline.cpp:20:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   20 | main(){
      | ^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 18008 KB 200 token(s): yes count is 21, no count is 179
2 Correct 27 ms 18268 KB 200 token(s): yes count is 70, no count is 130
3 Correct 21 ms 17500 KB 197 token(s): yes count is 25, no count is 172
# 결과 실행 시간 메모리 Grader output
1 Correct 753 ms 84592 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 750 ms 84484 KB 4000 token(s): yes count is 91, no count is 3909
3 Execution timed out 2031 ms 71104 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2036 ms 143612 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 126 ms 17908 KB expected YES, found NO [355th token]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2054 ms 134576 KB Time limit exceeded
2 Halted 0 ms 0 KB -