oj.uz

Submission #1071287

# Submission time Handle Problem Language Result Execution time Memory
1071287 2024-08-23T06:34:15 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++
8 / 100
 3000 ms 8056 KB 
// Balgabaev Mansur
#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define int long long


using namespace std;

const int N=1e6+7;
const int MOD=1e9+7;
const int INF=1e18;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

int a[N];

void solve(){
	int n,m;
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
	}
	for(int tt = 1 ; tt <= m ; tt++){
		int l,r,k;
		cin >> l >> r >> k;
		bool ok=true;
		for(int i = l ; i < r ; i++){
			for(int j = i+1 ; j <= r ; j++){
				if(a[i]+a[j] > k and a[i] > a[j]){
					ok=false;
				}
			}
		}
		cout << ok << '\n';
	}
}	
 
signed main() {
   // freopen("closing.in", "r", stdin);
   // freopen("closing.out", "w", stdout);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int test = 1,cntx=1;
    //cin >> test;
    while (test--) {
	//cout << "Case " << 	cntx << ':' << '\n';
        solve();
        cntx++;
	}		
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 11 ms 480 KB Output is correct
8 Correct 23 ms 348 KB Output is correct
9 Correct 9 ms 468 KB Output is correct
10 Correct 23 ms 348 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 11 ms 480 KB Output is correct
8 Correct 23 ms 348 KB Output is correct
9 Correct 9 ms 468 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 492 ms 520 KB Output is correct
12 Execution timed out 3029 ms 576 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3054 ms 8056 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3044 ms 2648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 11 ms 480 KB Output is correct
8 Correct 23 ms 348 KB Output is correct
9 Correct 9 ms 468 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 492 ms 520 KB Output is correct
12 Execution timed out 3029 ms 576 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 11 ms 480 KB Output is correct
8 Correct 23 ms 348 KB Output is correct
9 Correct 9 ms 468 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 492 ms 520 KB Output is correct
12 Execution timed out 3029 ms 576 KB Time limit exceeded
13 Halted 0 ms 0 KB -