제출 #992304

#제출 시각아이디문제언어결과실행 시간메모리
992304ramalzaherTrampoline (info1cup20_trampoline)C++14
43 / 100
2068 ms576696 KiB
#include <bits/stdc++.h>
#define ll long long  
#define sz size()
#define pb push_back
#define all(x) x.begin() , x.end()
using namespace std;
const int N = 2505 ; 
int r , c , n ; 
map<pair<int,int> , int > mp ;  
bool bfs(int xx , int yy , int endx , int endy  ){
	queue<pair<int,int> > q ; 
	q.push({xx , yy}) ;
while (q.size())
{
	auto &[x,y]  = q.front() ;
	q.pop() ; 
	if(x == endx && y <= endy ) {return 1 ;}
	if(mp[{x,y}]){
		if(x+1 <= r ){  
		q.push({x+1 , y}) ;
		}
		}
		else {
		if(y+1 <= c ) {
		q.push({x , y + 1 });	
			}
		}
	}
	return 0 ; 		
}


int main()
{
	 cin >> r >> c >> n ;
	for (int i = 0; i < n; i++)
	{
		int a, b ; cin >> a >> b; 
		mp[{a,b}]=1;
	}
	int t ; cin >> t; 
	for (int i = 0; i < t; i++)
	{
		int sx , sy  , ex , ey ; cin >> sx >> sy >> ex >> ey; 		
		bool ok = bfs(sx , sy , ex, ey) ;
		if(ok)cout<<"Yes\n" ;	else cout<<"No\n";  
	}
	


  return 0;
}
/*
  4 4 3
  1 1 
  2 1 
  3 4 
  1
  1 1 4 3 
 * 
 *  
 * 
 * */

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

trampoline.cpp: In function 'bool bfs(int, int, int, int)':
trampoline.cpp:15:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   15 |  auto &[x,y]  = q.front() ;
      |        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...