oj.uz

Submission #1010167

# Submission time Handle Problem Language Result Execution time Memory
1010167 2024-06-28T12:18:58 Z LCJLY Trampoline (info1cup20_trampoline) C++14
11 / 100
 2000 ms 22880 KB 
#include <bits/stdc++.h>
using namespace std;
	
#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef array<int,3>pi2;

void solve(){	
	int n,m,k;
	cin >> n >> m >> k;
	
	pii arr[k];
	unordered_map<int,vector<int>>mp;
	for(int x=0;x<k;x++){
		cin >> arr[x].first >> arr[x].second;
		mp[arr[x].first].push_back(arr[x].second);
	}
	
	for(auto &it:mp){
		sort(it.second.begin(),it.second.end());
	}
	
	int q;
	cin >> q;
	pii st,ed;
	
	for(int x=0;x<q;x++){
		cin >> st.first >> st.second >> ed.first >> ed.second;
		
		int cur=st.second;
		bool amos=true;
		for(int y=st.first;y<ed.first;y++){
			int index=lower_bound(mp[y].begin(),mp[y].end(),cur)-mp[y].begin();
			if(index>=(int)mp[y].size()){
				amos=false;
				break;
			}
			cur=mp[y][index];
		}
		
		if(amos&&cur<=ed.second){
			cout << "Yes\n";
		}
		else cout << "No\n";
	}

}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	//freopen("in.txt","w",stdout);
	while(t--){
		solve();
	}
}

Subtask #1
0 / 23.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 6484 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 46 ms 8272 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 87 ms 7252 KB 4000 token(s): yes count is 4000, no count is 0
4 Incorrect 139 ms 8272 KB expected NO, found YES [1000th token]
5 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 13956 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 122 ms 17864 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 113 ms 17940 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 113 ms 18512 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 120 ms 18572 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 127 ms 22880 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 3 ms 604 KB expected NO, found YES [17th token]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

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