Submission #889747

#	Time	Username	Problem	Language	Result	Execution time	Memory
889747		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3067 ms	5724 KiB

sortbooks

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define forik(x) ll i = 1; i <= x; i++

// (a mod 1e9) / (b mod 1e9) = a * (b^1e9)

using namespace std;

ll a, b, c, d, e, t, n, m, k, p[200001];
vector <pair <ll, ll>> g;

//ll gcd (ll a, ll b){
//	while (a > 0 && b > 0){
//		if (a >= b){
//			a %= b;
//		}
//		else{
//			b %= a;
//		}
//	}
//	return a + b;
//}
//
//ll binpow (ll a, ll b){
//	a %= mod;
//	if (b == 0){
//		return 1;
//	}
//	if (b % 2 == 1){
//		return binpow (a, b - 1) % mod * a % mod;
//	}
//	else{
//		ll t = binpow (a, b / 2) % mod;
//		return t * t % mod;
//	}
//}

signed main (){
	//freopen (".in", "r", stdin);
	//freopen (".out", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		cin >> p[i];
	}
	while (m--){
		cin >> a >> b >> c;
		g.clear();
		for (int i = a; i <= b; i++){
			g.pb ({p[i], i});
		}
		sort (all (g));
		a = 1;
		for (int i = 0; i < g.size() - 1; ++i){
			for (int y = i + 1; y < g.size(); y++){
				if (g[i].S > g[y].S && g[i].F + g[y].F > c){
					a = 0;
				}
			}
		}
		cout << a << '\n';
	}
}

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:65:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for (int i = 0; i < g.size() - 1; ++i){
      |                   ~~^~~~~~~~~~~~~~
sortbooks.cpp:66:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |    for (int y = i + 1; y < g.size(); y++){
      |                        ~~^~~~~~~~~~

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