oj.uz

답안 #894804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894804 2023-12-29T04:04:12 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 2140 KB 
//Bismillahir-Rahmanir-Rahim
#include <bits/stdc++.h>
            
using namespace std;
         
#define flash ios_base::sync_with_stdio(0),cin.tie(0)
#define pb push_back
#define ll long long
#define ld long double
#define dbg(x) cerr << #x << " = " << x << "\n";
#define ff first
#define ss second
     
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma comment (linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
    
const long long INF = 1e9 + 7;
const long long MOD = 1e9 + 7;
const int maxn = 2e5 + 10;
const int lg = 20;

int n, m, a[maxn], b[maxn];
vector <int> v;

void press_F_() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	while(m--) {
		int l, r, k;
		cin >> l >> r >> k;
		for (int j = l; j <= r; j++) {
			b[j] = a[j];
		}
		for (int j = l; j <= r; j++) {
			for (int i = l; i < r; i++) {
				if (b[i] > b[i + 1] && b[i] + b[i + 1] <= k) {
					swap(b[i], b[i + 1]);
				}
			}
		}
		bool ok = 1;
		for (int i = l; i < r; i++) {
			if (b[i] > b[i + 1]) {
				cout << 0 << '\n';
				ok = 0;
				break;
			}
		}
		if (ok) {
			cout << 1 << '\n';
		}
	}
}
   
int main() {
    flash;
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++) {
        press_F_();
    }
    //Respa gold 2023-2024 InshAllah
    return 0;
}
/*
Maybe not today and tomorrow, but InshAllah one day I will reach expert
*/
// g++ -std=c++17 main.cpp
// ./a.out

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 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 36 ms 348 KB Output is correct
7 Correct 35 ms 348 KB Output is correct
8 Correct 54 ms 600 KB Output is correct
9 Correct 17 ms 348 KB Output is correct
10 Correct 60 ms 452 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 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 36 ms 348 KB Output is correct
7 Correct 35 ms 348 KB Output is correct
8 Correct 54 ms 600 KB Output is correct
9 Correct 17 ms 348 KB Output is correct
10 Correct 60 ms 452 KB Output is correct
11 Correct 1705 ms 784 KB Output is correct
12 Execution timed out 3016 ms 600 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 16 ms 2140 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 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 36 ms 348 KB Output is correct
7 Correct 35 ms 348 KB Output is correct
8 Correct 54 ms 600 KB Output is correct
9 Correct 17 ms 348 KB Output is correct
10 Correct 60 ms 452 KB Output is correct
11 Correct 1705 ms 784 KB Output is correct
12 Execution timed out 3016 ms 600 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 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 36 ms 348 KB Output is correct
7 Correct 35 ms 348 KB Output is correct
8 Correct 54 ms 600 KB Output is correct
9 Correct 17 ms 348 KB Output is correct
10 Correct 60 ms 452 KB Output is correct
11 Correct 1705 ms 784 KB Output is correct
12 Execution timed out 3016 ms 600 KB Time limit exceeded
13 Halted 0 ms 0 KB -