제출 #1104795

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104795		abushbandit_	Trampoline (info1cup20_trampoline)	C++17	62 / 100	2055 ms	12692 KiB

trampoline

#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")

#include "bits/stdc++.h"

using namespace std;

//~ #ifndef ONLINE_JUDGE
//~ #include "debug.h"
//~ #else
//~ #define debug(...)
//~ #define debugArr(...)
//~ #endif

#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back

template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }

const int inf = 1e9;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;

void solve() {
	
	int r,c,n;
	cin >> r >> c >> n;
	int a[n],b[n];
	vector<pair<int,int>> v;
	for(int i = 0;i < n;i++) {
		cin >> a[i] >> b[i];
		v.pb({a[i],b[i]});
	}
	sort(all(v));
	int q;
	cin >> q;
	while(q--) {
		int xs,ys,xf,yf;
		cin >> xs >> ys >> xf >> yf;
		bool check = 0;
		for(int i = 0;i < n;i++) {
			if(xs == xf && yf >= ys) {
				check = 1;
				break;
			}
			if(v[i].ff == xs && v[i].ss >= ys) {
				xs++;
				ys = v[i].ss;
			}
		}
		if(xs == xf && yf >= ys) {
			check = 1;
		}
		if(check) {
			cout << "Yes\n";
		} else {
			cout << "No\n";
		}
	}
}

signed main() {
	
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	
	int t = 1;
	//~ cin >> t;
	while(t--) {
		solve();
	}
	
	
}

• Subtask 1: 23 / 23
• Subtask 2: 20 / 20
• Subtask 3: 0 / 11
• Subtask 4: 19 / 19
• Subtask 5: 0 / 27