oj.uz

답안 #523866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523866 2022-02-08T10:12:26 Z iskhakkutbilim Trampoline (info1cup20_trampoline) C++14
0 / 100
 415 ms 1048580 KB 
// Author: Tazhibaev Iskhak
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 

using namespace __gnu_pbds;
using namespace std;

typedef tree<pair<int, int> ,null_type,less< pair<int, int> >,rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const long double pi = acos((long double) - 1.0);
const double eps = (double)1e-9;
const int INF = 1e9 + 7;
    #define ff         first
    #define ss         second
    #define ll         long long
    #define ld		   long double
    #define pb         push_back
void usaco( string filename){
  freopen((filename+".in").c_str(), "r", stdin);
  freopen((filename+".out").c_str(), "w", stdout);
}
int r, c, n;

int in(int i, int j){
	if(i >= 1 and i <= r and j >= 1 and j <= c) return 1;
			return 0;
}


main(){
	 ios_base::sync_with_stdio(false);
	 cin.tie(nullptr); cout.tie(nullptr);
	 cin >> r >> c >> n;
	 set< pair<int, int> > st;
	 vector<int> g[r + 1];
	 for(int i = 0;i < n; i++){
	 	int x, y; 
	 	cin >> x >> y;
	 	st.insert({x, y});
	 }		 
	 for(auto it : st){
	 	g[it.ff].push_back(it.ss);
	 }
     int T;
     cin >> T;
     while(T--){
     	pair<int, int> start;
     	cin >> start.ff >> start.ss;
     	pair<int, int> end;
     	cin >> end.ff >> end.ss;
     	int x, y;
     	if(end.ff - start.ff == 1){
     		
     		x = start.ff;
     		y = start.ss;
     		while(x < end.ff and x <= r and y <= c){
     			int L = lower_bound(g[x].begin(), g[x].end(), y) - g[x].begin();
     			if(L >= g[x].size()) break;
     			y = g[x][L];
     			x++;
     		}
     		if(x == end.ff and y <= end.ss) cout << "Yes";
 			else cout << "No";
     		cout << "\n";
     	}else if(end.ff == start.ff and end.ss >= end.ff){
     		cout << "Yes" << "\n";
     		continue;
     	}else if(end.ff < start.ff ){
     		cout << "No" << "\n";
     		continue;
     	}else if(end.ss < start.ss){
     		cout << "No" << "\n";
     		continue;
     	}
     	x = start.ff;
     	y = start.ss;
 		while(x != end.ff){
 			if(y == c) break;
 			if(y > end.ss) break;
 			if(st.count({x, y})) x++;
 			else y++;
 		}
 		if(x == end.ff and y <= end.ss) cout << "Yes";
 		else cout << "No";
     	cout << "\n";
     }
    return 0;
}

Compilation message

trampoline.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main(){
      | ^~~~
trampoline.cpp: In function 'int main()':
trampoline.cpp:59:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         if(L >= g[x].size()) break;
      |            ~~^~~~~~~~~~~~~~
trampoline.cpp: In function 'void usaco(std::string)':
trampoline.cpp:20:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |   freopen((filename+".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
trampoline.cpp:21:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   freopen((filename+".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 844 KB expected NO, found YES [60th token]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 290 ms 11780 KB expected NO, found YES [1823rd token]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

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