Submission #937478

#	Time	Username	Problem	Language	Result	Execution time	Memory
937478		Teemka	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3023 ms	4188 KiB

sortbooks

#include "bits/stdc++.h" 
#define F first
#define S second
#define ALL(a) a.begin() , a.end()

#ifndef ONLINE_JUDGE
#define OK  cout << __LINE__ << "| "<< "---------------------------OK-----------------------" << endl;
#define deb(x) cout << __LINE__ << "| "<< #x  << " = " << x << endl;
#else
#define OK  
#define deb(x) 
#endif
 
typedef long double ld;
typedef long long ll;
using namespace std ;
const ll N = 2e5 ;	
const ll INF = 1e9;
const ll mod = 1e9 + 7 ;
const double eps = 1e-9 ;
const int dx[]  = { 0 , 0 , 1 , -1, 1 , -1 , 1 , -1} , dy[] = {1 , -1 , 0 , 0 , 1 , 1, -1 , -1}  ;
int n , q, a[N] ;
vector<pair<int,int > > vec;
void test_solve(int test_index){
	cin >> n >> q;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}

	for(int query = 1; query <= q ; query++){
		int l , r , k , ans = 1;
		cin >>  l >> r >> k;
		vec.clear();
		for(int i = l; i <= r; i++){
			vec.push_back({a[i] , i - l});
		}
		sort(ALL(vec));
		for(int i = 0 ; i< vec.size() and ans; i++){
			int ll = i , rr = vec[i].S;
			if(ll > rr)
				swap(ll,  rr);
			for(int j = ll + 1; j <= rr - 1; j++){
				if(vec[i].F + vec[j].F > k and vec[i].F != vec[j].F){
					ans = 0 ;
					break;
				}
			}
		}
		cout << ans << endl;
	}
}

signed main(){
	ios_base::sync_with_stdio(false) ;
    cin.tie(0) ;
    cout.tie(0); 
	int test = 1;
	//cin >> test ;
	for(int i = 1 ;  i <= test ; i++){
 //		cout << "Case " << i << ": " ; 
		test_solve(i) ;
	}
  	return 0;	
}        

Compilation message (stderr)

sortbooks.cpp: In function 'void test_solve(int)':
sortbooks.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |   for(int i = 0 ; i< vec.size() and ans; i++){
      |                   ~^~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23