oj.uz

답안 #1008851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1008851 2024-06-27T02:27:55 Z PenguinsAreCute Trampoline (info1cup20_trampoline) C++17
62 / 100
 2000 ms 53372 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 420690;
const int INF = 1210201069;
vector<pair<int,int>> seg[MAXN<<1];
int f(int i, int x) {return (*lower_bound(seg[i].begin(),seg[i].end(),make_pair(x,0))).second;}
void build() {
	for(int i=MAXN;i--;) for(auto [j, k]: seg[i<<1]) {
		int cur = f(i<<1|1,k);
		while(seg[i].size()&&seg[i].back().second==cur)
			seg[i].pop_back();
		seg[i].push_back({j,cur});
	}
}
int qry(int l, int r, int x) {
	stack<int> st;
	for(l+=MAXN,r+=MAXN;l<r;l>>=1,r>>=1) {
		if(l&1) x=f(l++,x);
		if(r&1) st.push(--r);
	}
	while(st.size()) {
		x=f(st.top(),x);
		st.pop();
	}
	return x;
}
main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int r, c, n; cin >> r >> c >> n;
	vector<int> v; int x[n], y[n];
	for(int i=0;i<n;i++) {
		cin >> x[i] >> y[i];
		v.push_back(x[i]);
		v.push_back(x[i]+1);
	}

	sort(v.begin(),v.end());
	v.resize(unique(v.begin(),v.end())-v.begin());
	for(int i=0;i<n;i++)
		x[i]=lower_bound(v.begin(),v.end(),x[i])-v.begin();
	for(int i=0;i<n;i++)
		seg[x[i]+MAXN].push_back({y[i],y[i]});
	for(int i=0;i<n;i++)
		sort(seg[x[i]+MAXN].begin(),seg[x[i]+MAXN].end());
	for(int i=0;i<MAXN;i++)
		seg[i+MAXN].push_back({INF,INF});
	build();

	int t; cin >> t;
	while(t--) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		if(x1==x2) {
			cout << (y1<=y2?"Yes\n":"No\n");
			continue;
		}
		if(x1>x2) {
			cout << "No\n";
			continue;
		}
		auto it1 = lower_bound(v.begin(),v.end(),x1);
		auto it2 = lower_bound(v.begin(),v.end(),x2);
		if(it1==v.end()||it2==v.end()||(*it1)!=x1||(*it2)!=x2) {
			cout << "No\n";
			continue;
		}
		cout << (qry(it1-v.begin(),it2-v.begin(),y1)<=y2?"Yes\n":"No\n");
	}
} // noice

Compilation message

trampoline.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main() {
      | ^~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 46676 KB 200 token(s): yes count is 21, no count is 179
2 Correct 53 ms 46684 KB 200 token(s): yes count is 70, no count is 130
3 Correct 46 ms 46676 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 218 ms 52932 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 198 ms 52932 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 650 ms 53156 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 237 ms 52936 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
0 / 11.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 46672 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 54 ms 46588 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 47 ms 46416 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 102 ms 46464 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 50 ms 46676 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 151 ms 46476 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 52436 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 291 ms 53372 KB 200000 token(s): yes count is 161254, no count is 38746
3 Execution timed out 2059 ms 25440 KB Time limit exceeded
4 Halted 0 ms 0 KB -