oj.uz

답안 #364520

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364520 2021-02-09T12:00:42 Z AmineWeslati Trampoline (info1cup20_trampoline) C++14
100 / 100
 1217 ms 68268 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

const int LOG=25;

int R,C,N;
map<int,vpi>g;
vi X(MX),Y(MX),nxt(MX);
int jump[MX][LOG];

void precompute(){
	FOR(j,0,LOG) FOR(i,0,N){
		if(!j) jump[i][j]=nxt[i];
		else{
			if(jump[i][j-1]==-1) jump[i][j]=-1;
			else jump[i][j]=jump[jump[i][j-1]][j-1];
		}
	}
}

int solve(int i, int x){
	bitset<LOG>b(x);
	ROF(j,0,LOG) if(b[j]){
		i=jump[i][j];
		if(i==-1) return -1;
	}
	return i;
}

int32_t main() {
    boost; IO();

    cin>>R>>C>>N;
    FOR(i,0,N){
    	int x,y; cin>>x>>y;
    	X[i]=x; Y[i]=y;
    	g[x].pb({y,i});
    }
    for(auto &x: g) sort(all(x.se));

    FOR(i,0,N){
    	int x=X[i],y=Y[i];
    	if(!g.count(x+1)) nxt[i]=-1;
    	else{
    		auto it=lower_bound(all(g[x+1]),pi{y,-INF})-g[x+1].begin();
    		if(it==sz(g[x+1])) nxt[i]=-1;
    		else nxt[i]=g[x+1][it].se;
    	}
    }
    precompute();


    int Q; cin>>Q;
    while(Q--){
    	int x,y,xx,yy,ans=0; cin>>x>>y>>xx>>yy;
    	if(xx>=x && yy>=y){
    		if(x==xx) ans=1;
    		else if(g.count(x)){
				auto it=lower_bound(all(g[x]),pi{y,-INF})-g[x].begin();
    			if(it<sz(g[x])){
    				int idx=g[x][it].se;
    				int f=solve(idx,xx-x-1);
    				if(f!=-1 && Y[f]<=yy) ans=1;
    			}
    		}
    	}
    	if(ans) cout << "Yes" << endl;
    	else cout << "No" << endl;
    }
    

    return 0;
}
//Change your approach

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 7020 KB 200 token(s): yes count is 21, no count is 179
2 Correct 13 ms 7532 KB 200 token(s): yes count is 70, no count is 130
3 Correct 9 ms 6764 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 50028 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 292 ms 51308 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 270 ms 50028 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 300 ms 51244 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 49500 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 353 ms 48900 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 392 ms 48720 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 533 ms 50156 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 520 ms 50124 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 848 ms 55524 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6124 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 11 ms 6508 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 13 ms 6892 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 10 ms 6508 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 15 ms 6636 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 9 ms 6508 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1062 ms 56748 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 834 ms 52436 KB 200000 token(s): yes count is 161254, no count is 38746
3 Correct 404 ms 48988 KB 200000 token(s): yes count is 117455, no count is 82545
4 Correct 1217 ms 68268 KB 200000 token(s): yes count is 182118, no count is 17882
5 Correct 682 ms 56212 KB 200000 token(s): yes count is 167565, no count is 32435
6 Correct 405 ms 50664 KB 200000 token(s): yes count is 156797, no count is 43203
7 Correct 404 ms 50792 KB 200000 token(s): yes count is 156797, no count is 43203
8 Correct 378 ms 49980 KB 200000 token(s): yes count is 122100, no count is 77900
9 Correct 975 ms 56812 KB 200000 token(s): yes count is 139670, no count is 60330
10 Correct 1012 ms 57452 KB 200000 token(s): yes count is 165806, no count is 34194
11 Correct 1169 ms 62336 KB 200000 token(s): yes count is 175646, no count is 24354
12 Correct 339 ms 49744 KB 200000 token(s): yes count is 134695, no count is 65305
13 Correct 378 ms 50524 KB 200000 token(s): yes count is 126733, no count is 73267
14 Correct 576 ms 51544 KB 200000 token(s): yes count is 155290, no count is 44710
15 Correct 352 ms 49916 KB 200000 token(s): yes count is 129674, no count is 70326