oj.uz

답안 #992295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
992295 2024-06-04T08:53:18 Z ramalzaher Trampoline (info1cup20_trampoline) C++14
23 / 100
 2000 ms 88348 KB 
#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 = 3000 ; 
bool vis[N][N] ; int r , c , n ; 
map<pair<int,int> , int > mp ;  
void bfs(int xx , int yy , int end ){
	vis[xx][yy] =1 ; 
	queue<pair<int,int> > q ; 
	q.push({xx , yy}) ;
while (q.size())
{
	auto &[x,y]  = q.front() ;
	q.pop() ; 
	if(mp[{x,y}]){
		if(x+1 <= r ){  
		if(!vis[x+1][y]) {
		q.push({x+1 , y}) ; 
		vis[1+x][y] = 1; }}
		
		}
		else {
		if(y+1 <= c ) {
		if(vis[x][y+1])continue ; 
		vis[x][y+1] =1 ; 
		q.push({x , y + 1 });	
			}
		}
	}		
}


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; 
		memset(vis ,0 , sizeof vis) ;
		bfs(sx , sy,ex) ;bool ok =0 ;
		for (int j = 0; j < ey+1; j++)
		{
				if(vis[ex][j]==1){ok=1;break;}  }
			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 
 * 
 *  
 * 
 * */

Compilation message

trampoline.cpp: In function 'void bfs(int, int, int)':
trampoline.cpp:16:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   16 |  auto &[x,y]  = q.front() ;
      |        ^

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 10064 KB 200 token(s): yes count is 21, no count is 179
2 Correct 46 ms 10076 KB 200 token(s): yes count is 70, no count is 130
3 Correct 44 ms 9820 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1613 ms 87408 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 1643 ms 88348 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 1377 ms 23632 KB 4000 token(s): yes count is 4000, no count is 0
4 Execution timed out 2065 ms 74804 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

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