oj.uz

Submission #894835

# Submission time Handle Problem Language Result Execution time Memory
894835 2023-12-29T05:35:19 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 604 KB 
// Problem: C - Hedgehog Daniyar and Algorithms
// Contest: Virtual Judge - Yosik IOI contest #1
// URL: https://vjudge.net/contest/601761#problem/C
// Memory Limit: 256 MB
// Time Limit: 3000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define all(v) (v).begin(),(v).end()
#define rall(v) ((v).rbegin()), ((v).rend())
#define out(v)  for(auto& i : v) cout << i << ' ';
#define F first
#define S second
#define int long long

const ll N = 5000 + 17;
const ll MOD = 1e9 + 7;
const string alf = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

int a[N] , b[N] , pref[N];

void solve (){
	int n , m;
	cin >> n >> m;
	int ok = 1;
	for(int i = 1; i <= n; i ++){
		cin >> a[i];
	}
	for(int i = 1; i <= n; i ++){
		pref[i] = pref[i - 1];
		if (a[i] < a[i - 1]){
			pref[i] = i;
		}
	}
	if (n <= 5000 && m <= 5000){
	for(int x = 1; x <= m; x ++){
		int l ,r , k;
		cin >> l >> r >> k;
		for(int i = l ; i <= r; i ++){
			b[i] = a[i];
		}
		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]);
				}
			}
		}
		int ok = 1;
		for(int i= l; i < r; i ++){
			if (b[i] > b[i + 1]){
				ok = 0;
				break;
			}
		}
		cout << ok << endl;
	}
	}
	else {
		for(int x = 1; x <= m; x++){
			int l , r , k;
			cin >> k >> r >> k;
			cout << (pref[r] <= l) << endl;
		}
	}
}

signed main(){
	// freopen("ones.in" , "r" , stdin) ;
	// freopen("ones.out" , "w" , stdout) ;
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	// int cs = 1;
	// cin >>T;
	while (T --){
		// cout <<"Case " << cs ++<< ":" << endl;
		solve ();
		// cout <<endl;
	}
}

Compilation message

sortbooks.cpp: In function 'void solve()':
sortbooks.cpp:31:6: warning: unused variable 'ok' [-Wunused-variable]
   31 |  int ok = 1;
      |      ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 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 38 ms 348 KB Output is correct
7 Correct 38 ms 348 KB Output is correct
8 Correct 55 ms 344 KB Output is correct
9 Correct 17 ms 344 KB Output is correct
10 Correct 60 ms 344 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 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 38 ms 348 KB Output is correct
7 Correct 38 ms 348 KB Output is correct
8 Correct 55 ms 344 KB Output is correct
9 Correct 17 ms 344 KB Output is correct
10 Correct 60 ms 344 KB Output is correct
11 Correct 1721 ms 488 KB Output is correct
12 Execution timed out 3038 ms 572 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 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 38 ms 348 KB Output is correct
7 Correct 38 ms 348 KB Output is correct
8 Correct 55 ms 344 KB Output is correct
9 Correct 17 ms 344 KB Output is correct
10 Correct 60 ms 344 KB Output is correct
11 Correct 1721 ms 488 KB Output is correct
12 Execution timed out 3038 ms 572 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 600 KB Output is correct
2 Correct 0 ms 344 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 38 ms 348 KB Output is correct
7 Correct 38 ms 348 KB Output is correct
8 Correct 55 ms 344 KB Output is correct
9 Correct 17 ms 344 KB Output is correct
10 Correct 60 ms 344 KB Output is correct
11 Correct 1721 ms 488 KB Output is correct
12 Execution timed out 3038 ms 572 KB Time limit exceeded
13 Halted 0 ms 0 KB -