제출 #1122496

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122496		thelegendary08	Trampoline (info1cup20_trampoline)	C++17	0 / 100	2095 ms	64244 KiB

trampoline

#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) cout<<#v<<' '; for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
bool cmp(pii a, pii b){
	return a.first < b.first;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(r,c,n);
	vpii v;
	set<int>xs;
	f0r(i, n){
		in2(a,b);
		v.pb({a,b});
		xs.insert(a);
	}
	sort(all(v));
	
	vi thing;
	for(auto u : xs)thing.pb(u);
	mii zipped;
	int cnt = 0;
	for(auto u : xs){
		zipped[u] = cnt;
		cnt++;
	}
	vector<set<int>>w(thing.size());
	f0r(i,n){
		w[zipped[v[i].first]].insert(v[i].second);
	}
	int cur = v[0].first;
	vpii a;
	vpii b;
	int st;
	f0r(i, n){
		if(v[i].first == cur){
			a.pb({v[i].second, i});
		}
		else{
			st = i;
			break;
		}
	}
	
	bool sec = 1;
	cur++;
	vi nxt(n, -1);
	FOR(i, st, n){
		if(v[i].first == cur){
			if(sec)b.pb({v[i].second, i});
			else a.pb({v[i].second, i});
		}
		else{
			if(sec){
				int p1 = 0;
				int p2 = 0;
				while(p1 < a.size() && p2 < b.size()){
					if(a[p1].first <= b[p2].first){
						nxt[a[p1].second] = b[p2].second;
						p1++;
					}
					else{
						p2++;
					}
				}
				if(v[i].first == cur + 1){
					cur = v[i].first;
					a = b;
					b.clear();
					
				}
				else{
					sec = 0;
					a.clear();
					b.clear();
					cur = v[i].first;
				}
			}
			else{
				cur++;
				sec = 1;
			}
			
		}
	}
	
	if(sec){
		int p1 = 0;
		int p2 = 0;
		while(p1 < a.size() && p2 < b.size()){
			if(a[p1].first <= b[p2].first){
				nxt[a[p1].second] = b[p2].second;
				p1++;
			}
			else{
				p2++;
			}
		}
	}
	//vout(nxt);
	
	
	vvi jmp(n, vi(18));
	f0r(i,n){
		jmp[i][0] = nxt[i];
	}
	FOR(i, 1, 18){
		f0r(j, n){
			if(jmp[j][i-1] != -1)jmp[j][i] = jmp[jmp[j][i-1]][i-1];
			else jmp[j][i] = -1;
		}
	}
	//out(0);
	
	
	in(q);
	while(q--){
		in4(a,b,c,d);
		if(a == c){
			yn(b <= d);
		}
		else{
			//get from nearest tramp at a to tramp at c-1
			if(!xs.count(a))out("No");
			else{
				auto it = lower_bound(all(w[zipped[a]]), b);
				if(it == w[zipped[a]].end()){
					out("No");
				}
				else{
					int y = *it;
					int cur = -1;
					if(binary_search(all(v), make_pair(a,y)))cur = lower_bound(all(v), make_pair(a,y)) - v.begin();
					int jumps = c - a - 1;
					if(cur != -1){
						f0r(i, 18){
							if((1 << i) & jumps){
								cur = jmp[cur][i];
							}
							if(cur == -1)break;
						}
					}
					
					// out(cur);
					if(cur == -1)out("No");
					else{
						yn(v[cur].second <= d);
					}
				}
			}
			
		}
	}
	
	
}

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