oj.uz

Submission #365712

# Submission time Handle Problem Language Result Execution time Memory
365712 2021-02-12T08:40:33 Z amunduzbaev Trampoline (info1cup20_trampoline) C++14
54 / 100
 2000 ms 14684 KB 
/** 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)) no, 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.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 748 KB 200 token(s): yes count is 21, no count is 179
2 Correct 6 ms 752 KB 200 token(s): yes count is 70, no count is 130
3 Correct 4 ms 620 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 6236 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 146 ms 7644 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 309 ms 7168 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 693 ms 7776 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 6748 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 197 ms 7516 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 211 ms 7132 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 251 ms 7736 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 260 ms 7644 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 358 ms 14684 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 620 KB expected YES, found NO [105th token]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 13020 KB Time limit exceeded
2 Halted 0 ms 0 KB -