Submission #365714

#	Time	Username	Problem	Language	Result	Execution time	Memory
365714		amunduzbaev	Trampoline (info1cup20_trampoline)	C++14	73 / 100	2086 ms	13016 KiB

trampoline

/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef pair<ll, ll> pll; 
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}

#define no cout<<"No\n"
#define yes cout<<"Yes\n"

const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

#define MULTI 0

int n, m, k, ans, res, a[N]; 

void solve(int t_case){
	cin>>n>>m>>k;
	map<int, vii> mm;
	vpii tt;
	for(int i=0;i<k;i++){
		int x, y; cin>>x>>y;
		tt.pb({x, y});
	}sort(all(tt));
	for(auto x:tt) mm[x.ff].pb(x.ss);
	
	int t; cin>>t;
	for(int i=0;i<t;i++){
		int x, y, x1, y1; cin>>x>>y>>x1>>y1;
		//if(x == x1 && y <= y1) { yes; continue; }
		if(x1 < x || y1 < y || !mm.count(x)) { no; continue; }
		bool ok = 1;
		while(x < x1 && ok){
			if(!mm.count(x)) ok = 0; 
			auto tt = lb(all(mm[x]), (int)y);
			if(tt == mm[x].end()) break;
			y = *tt, x++;
		}
		if(x == x1 && y <= y1) yes;
		else no; 
	}
}

signed main(){
	NeedForSpeed
	if(!MULTI) {
		solve(1);
	} else {
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	}
	return 0;
}

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