oj.uz

답안 #1027791

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027791 2024-07-19T09:56:03 Z vjudge1 Trampoline (info1cup20_trampoline) C++17
34 / 100
 2000 ms 57480 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 200005
#define fi first
#define se second

int r,c,timer;

vector<int> v[lim];

int dp[2505][2505];

int xm[lim],ym[lim];

int tut[lim];

map<int,int> mp;

set<int> st;

inline int f(int x,int y,int tx,int ty){
	if(x>r || y>c)return 0;
	if(x==tx && y<=ty)return 1;
	if(~dp[x][y])return dp[x][y];
	int cev=0;
	for(auto a:v[x]){
		if(a<y || a>ty)continue;
		cev+=f(x+1,a,tx,ty);
	}
	return dp[x][y]=cev;
}

inline void solve(int n){
	FOR{
		cin>>xm[i]>>ym[i];
		st.insert(xm[i]);
	}
	
	for(auto x:st){
		mp[x]=++timer;
		tut[timer]=x;
	}
	
	FOR{
		v[mp[xm[i]]].push_back(ym[i]);
	}
	
	for(int i=1;i<=timer;i++){
		sort(v[i].begin(),v[i].end());
	}
	
	int q;cin>>q;
	while(q--){
		int x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;
		if(mp.find(x1)==mp.end()){
			cout<<"No"<<'\n';
			continue;
		}
		int tut=lower_bound(v[mp[x1]].begin(),v[mp[x1]].end(),y1)-v[mp[x1]].begin();
		if(tut>=v[mp[x1]].size()){
			cout<<"No"<<'\n';
			continue;
		}
		if(v[mp[x1]][tut]<=y2){
			cout<<"Yes"<<'\n';
		}
		else cout<<"No"<<'\n';
	}
}

int32_t main(){
	faster
	int n;cin>>r>>c>>n;
	if(r<=2500 && c<=2500){
		FOR{
			int x,y;cin>>x>>y;
			v[x].push_back(y);
		}
	
		int q;cin>>q;
		while(q--){
			int x1,y1,x2,y2;
			cin>>x1>>y1>>x2>>y2;
			for(int i=1;i<=r;i++){
				for(int j=1;j<=c;j++){
					dp[i][j]=-1;
				}
			}
			int tut=f(x1,y1,x2,y2);
			if(tut)cout<<"Yes"<<'\n';
			else cout<<"No"<<'\n';
		}
		return 0;
	}
	solve(n);

	return 0;
}

Compilation message

trampoline.cpp: In function 'void solve(long long int)':
trampoline.cpp:70:9: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   if(tut>=v[mp[x1]].size()){
      |      ~~~^~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 11608 KB 200 token(s): yes count is 21, no count is 179
2 Correct 18 ms 9720 KB 200 token(s): yes count is 70, no count is 130
3 Correct 8 ms 11612 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
0 / 20.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 14276 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 125 ms 14208 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 138 ms 14420 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 192 ms 14928 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 199 ms 15036 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 357 ms 22864 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 397 ms 24824 KB expected NO, found YES [23rd token]
2 Halted 0 ms 0 KB -