oj.uz

답안 #892946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892946 2023-12-26T08:34:06 Z yuhong Trampoline (info1cup20_trampoline) C++17
11 / 100
 2000 ms 45592 KB 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#define endl '\n'
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define sz(x) (int)x.size()
#define int long long
#define float double
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define rep(i,a,b) for (ll i = a; i<b; i++)
#define repo(i,a,b) for (int i = a; i>=b; i--)
#define fi first
#define se second
//int decrow[4] = {-1,0,1,0};
//int deccol[4] = {0,1,0,-1};
//int dp[100001][100001];
//int arr[100001];
int dy[8] = {0,  0, 1, -1, 1, -1 , 1, -1};
int dx[8] = {1, -1, 0,  0, 1, -1, -1,  1};
const int MAXN = 1e6;
const int MOD = 1e9+7;
const int INF = 1e18;
int n,c,r;
int total = 0;
int ans = 0;
vi v;
int largerThanX(set<int> &s, int x){
    auto it = s.upper_bound(x);
    if(it == s.end()) return -1; /// x is larger than everything
    return *it;
}
gp_hash_table<int,set<int>> mp;
void solve(){
  int t;
  cin>>r>>c>>n;
  for(int i = 0;i<n;i++){
	  int a,b;
	  cin>>a>>b;
	  mp[a-1].insert(b-1);
  }
  cin>>t;
  while(t--){
	  int a,b,aa,bb;
	  cin>>a>>b>>aa>>bb;
	  a--,b--,aa--,bb--;
	  //only do on bb and b
	  int last = b;
	  int swi = 1;
	  for(int i = a;i<aa;i++){
		 int place = largerThanX(mp[i],last-1);
		 if(place == -1){
			 cout<<"No"<<endl;
			 swi = 0;
			 break;
		 }else{
			 if(place <= bb){
				 last = place;
			 }else{
				 swi = 0;
				 cout<<"No"<<endl;
				 break;
			 }
		 }
	  }
	  if(swi == 1){
		  cout<<"Yes"<<endl;
	  }
	}
}	
 
 
 
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
  int q;
  q =1;
  while(q--){
    solve();
  }
  return 0;
}

Subtask #1
0 / 23.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 11832 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 77 ms 11836 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 209 ms 11088 KB 4000 token(s): yes count is 4000, no count is 0
4 Incorrect 151 ms 11820 KB expected NO, found YES [1000th token]
5 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 222 ms 17432 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 223 ms 16716 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 207 ms 16944 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 194 ms 17232 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 180 ms 17360 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 218 ms 45592 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2028 ms 37252 KB Time limit exceeded
2 Halted 0 ms 0 KB -