oj.uz

답안 #950135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950135 2024-03-20T05:47:25 Z vjudge1 3단 점프 (JOI19_jumps) C++17
19 / 100
 330 ms 105976 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 2e5 + 1, mod = 1e9 + 7;

const ll inf = 1e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

void slave(int n) {
	int a[n + 1];
	for (int i = 1; i <= n; i++) cin >> a[i];
	int dp[n + 1][n + 1];
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= n; j++) {
			dp[i][j] = 0;
		}
	}
	for (int l = 1; l <= n; l++) {
		int p = l + 1, mx = 0;
		for (int r = l + 2; r <= n; r++) {
		 	while (p <= (r + l) / 2) {
		 		mx = max(mx, a[p]);
		 		p++;
		 	}
		 	dp[l][r] = a[l] + mx + a[r];
		}
	}
	for (int len = 3; len <= n; len++) {
		for (int l = 1; l <= n - len + 1; l++) {
			int r = l + len - 1;
			dp[l][r] = max({dp[l][r], dp[l + 1][r], dp[l][r - 1]});
		}
	}
	int q;
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		cout << dp[l][r] << '\n';
	}
}

void slv() {
	int n;
	cin >> n;
	if (n <= 5000) {
		slave(n);
		return;
	}
	int a[n + 1];
	for (int i = 1; i <= n; i++) cin >> a[i];
	int q;
	cin >> q;
	while (q--) {
		int l, r;
		cin >> l >> r;
		 
	}
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama

Compilation message

jumps.cpp:83:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   83 | main() {
      | ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 303 ms 105688 KB Output is correct
12 Correct 317 ms 105812 KB Output is correct
13 Correct 318 ms 105976 KB Output is correct
14 Correct 306 ms 105856 KB Output is correct
15 Correct 313 ms 105724 KB Output is correct
16 Correct 326 ms 105076 KB Output is correct
17 Correct 308 ms 105040 KB Output is correct
18 Correct 330 ms 105660 KB Output is correct
19 Correct 310 ms 105592 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 303 ms 105688 KB Output is correct
12 Correct 317 ms 105812 KB Output is correct
13 Correct 318 ms 105976 KB Output is correct
14 Correct 306 ms 105856 KB Output is correct
15 Correct 313 ms 105724 KB Output is correct
16 Correct 326 ms 105076 KB Output is correct
17 Correct 308 ms 105040 KB Output is correct
18 Correct 330 ms 105660 KB Output is correct
19 Correct 310 ms 105592 KB Output is correct
20 Incorrect 18 ms 1116 KB Output isn't correct
21 Halted 0 ms 0 KB -