oj.uz

답안 #992037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
992037 2024-06-03T16:17:21 Z ramalzaher Trampoline (info1cup20_trampoline) C++14
11 / 100
 2000 ms 28240 KB 
#include <bits/stdc++.h>
#define ll long long  
#define sz size()
#define pb push_back
#define all(x) x.begin() , x.end()
using namespace std;
bool check(vector<int> &a){
	for (int i = 0; i < a.size()-1 ; i++)
	{
		if(a[i] > a[i+1] ) return 0  ; 
	}
	
	return 1 ;
	}
int main()
{
	int r , c , n ; cin >> r >>c >> n ;
	map<int,set<int>>mp; 
	for (int i = 0; i < n; i++)
	{
		int a, b ; cin >> a >> b; 
		mp[a].insert(b) ; 
	}
	int t ; cin >> t; 
	for (int i = 0; i < t; i++)
	{
		vector<int> v ; bool ok= 0 ; 
		int sx , sy  , ex , ey ; cin >> sx >> sy >> ex >> ey; 
		v.pb(sy);
		for(int j = sx ; j < ex ; j ++ ){
			auto itt = mp[j].lower_bound(sy) ; 
			if(itt==mp[j].end()) { v.pb(-1);ok=1; break ; }
			v.pb(*itt) ; 
			sy = *itt ; 
			//cout<<sy<<" " ; 
			}
			v.pb(ey);
			//for(auto it : v)cout<<it<<" ";//cout<<endl; 
			if(check(v)&&ok==0)cout<<"Yes\n"; else cout<<"No\n"; 
	}
	


  return 0;
}

Compilation message

trampoline.cpp: In function 'bool check(std::vector<int>&)':
trampoline.cpp:8:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |  for (int i = 0; i < a.size()-1 ; i++)
      |                  ~~^~~~~~~~~~~~

Subtask #1
0 / 23.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 9800 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 188 ms 11720 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 381 ms 11348 KB 4000 token(s): yes count is 4000, no count is 0
4 Incorrect 558 ms 11860 KB expected NO, found YES [1000th token]
5 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 651 ms 10444 KB 200000 token(s): yes count is 110486, no count is 89514
2 Correct 658 ms 22100 KB 200000 token(s): yes count is 114664, no count is 85336
3 Correct 674 ms 22096 KB 200000 token(s): yes count is 86232, no count is 113768
4 Correct 691 ms 22308 KB 200000 token(s): yes count is 94603, no count is 105397
5 Correct 688 ms 22356 KB 200000 token(s): yes count is 94148, no count is 105852
6 Correct 753 ms 28240 KB 200000 token(s): yes count is 97163, no count is 102837

Subtask #4
0 / 19.0

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

Subtask #5
0 / 27.0

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