oj.uz

답안 #894836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894836 2023-12-29T05:37:34 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 4952 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 = 1e5 + 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 38 ms 2396 KB Output is correct
7 Correct 36 ms 2392 KB Output is correct
8 Correct 53 ms 2392 KB Output is correct
9 Correct 18 ms 2392 KB Output is correct
10 Correct 49 ms 2396 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 38 ms 2396 KB Output is correct
7 Correct 36 ms 2392 KB Output is correct
8 Correct 53 ms 2392 KB Output is correct
9 Correct 18 ms 2392 KB Output is correct
10 Correct 49 ms 2396 KB Output is correct
11 Correct 1765 ms 2508 KB Output is correct
12 Execution timed out 3052 ms 2592 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 169 ms 2904 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 38 ms 2396 KB Output is correct
7 Correct 36 ms 2392 KB Output is correct
8 Correct 53 ms 2392 KB Output is correct
9 Correct 18 ms 2392 KB Output is correct
10 Correct 49 ms 2396 KB Output is correct
11 Correct 1765 ms 2508 KB Output is correct
12 Execution timed out 3052 ms 2592 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 38 ms 2396 KB Output is correct
7 Correct 36 ms 2392 KB Output is correct
8 Correct 53 ms 2392 KB Output is correct
9 Correct 18 ms 2392 KB Output is correct
10 Correct 49 ms 2396 KB Output is correct
11 Correct 1765 ms 2508 KB Output is correct
12 Execution timed out 3052 ms 2592 KB Time limit exceeded
13 Halted 0 ms 0 KB -