oj.uz

답안 #312024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312024 2020-10-12T07:15:46 Z chctxdy68 수열 (APIO14_sequence) C++14
62 / 100
 410 ms 84364 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#define ppld pair <pld, pld>
#define ppll pair <pll, pll>
#define pldl pair <ld, ll>
#define vll vector <ll>
#define vvll vector <vll>
#define vpll vector <pll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define mll map <ll, ll>
#define fastmap gp_hash_table
#define cd complex <double>
#define vcd vector <cd>
#define PI 3.14159265358979
#define ordered_set tree <ll, null_type, less <ll>, rb_tree_tag, tree_order_statistics_node_update>
#pragma 03
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll dp[100005][2];
int trace[100005][205];
ll a[100005], prefix[100005];
int main(){
	fastio;
	ll n, k; cin >> n >> k; k++;
	for (ll i = 1; i <= n; i++) cin >> a[i];
	for (ll i = 1; i <= n; i++) prefix[i] = prefix[i - 1] + a[i];
	for (ll i = 1; i <= n; i++) dp[i][1] = (prefix[i] * prefix[i]);
	for (ll l = 2; l <= k; l++){
		ll ptr = l - 1; 
		ll now = l % 2, prv = now ^ 1;
		for (ll i = l; i <= n; i++){
			while ((ptr < i - 1) && (dp[ptr][prv] + (prefix[i] - prefix[ptr]) * (prefix[i] - prefix[ptr]) >= dp[ptr + 1][prv] + (prefix[i] - prefix[ptr + 1]) * (prefix[i] - prefix[ptr + 1]))) ptr++;
			dp[i][now] = dp[ptr][prv] + (prefix[i] - prefix[ptr]) * (prefix[i] - prefix[ptr]); trace[i][l] = ptr;
		}
	}
	cout << (prefix[n] * prefix[n] - dp[n][k % 2]) / 2 << "\n";
	ll cur = n;
	for (ll l = k; l > 1; l--){
		cout << trace[cur][l] << " "; cur = trace[cur][l]; 
	}
}

Compilation message

sequence.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops, no-stack-protector")
      | 
sequence.cpp:34: warning: ignoring #pragma 03  [-Wunknown-pragmas]
   34 | #pragma 03
      |

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 108 == 108
2 Correct 1 ms 384 KB contestant found the optimal answer: 999 == 999
3 Correct 1 ms 512 KB contestant found the optimal answer: 0 == 0
4 Correct 1 ms 384 KB contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 384 KB contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 384 KB contestant found the optimal answer: 1 == 1
7 Correct 0 ms 384 KB contestant found the optimal answer: 1 == 1
8 Correct 0 ms 384 KB contestant found the optimal answer: 1 == 1
9 Correct 0 ms 384 KB contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 384 KB contestant found the optimal answer: 900320000 == 900320000
11 Correct 1 ms 384 KB contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 384 KB contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 384 KB contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 384 KB contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 384 KB contestant found the optimal answer: 805 == 805
16 Correct 1 ms 384 KB contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 384 KB contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 384 KB contestant found the optimal answer: 302460000 == 302460000
3 Correct 1 ms 384 KB contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 384 KB contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 384 KB contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 384 KB contestant found the optimal answer: 933702 == 933702
7 Correct 1 ms 384 KB contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 384 KB contestant found the optimal answer: 687136 == 687136
9 Correct 1 ms 384 KB contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 384 KB contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB contestant found the optimal answer: 610590000 == 610590000
2 Correct 1 ms 512 KB contestant found the optimal answer: 311760000 == 311760000
3 Correct 1 ms 512 KB contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 512 KB contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 1 ms 512 KB contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 1 ms 512 KB contestant found the optimal answer: 107630884 == 107630884
7 Correct 1 ms 512 KB contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 1 ms 512 KB contestant found the optimal answer: 193556962 == 193556962
9 Correct 1 ms 512 KB contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 1 ms 512 KB contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1152 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 1 ms 1152 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 2 ms 1152 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 1 ms 1152 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 3 ms 1152 KB contestant found the optimal answer: 679388326 == 679388326
6 Incorrect 2 ms 1152 KB contestant didn't find the optimal answer: 4698976842 < 4699030287
7 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8704 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 6 ms 8704 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 22 ms 8704 KB contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 6 ms 8704 KB contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 23 ms 8704 KB contestant found the optimal answer: 1085432199 == 1085432199
6 Incorrect 23 ms 8704 KB contestant didn't find the optimal answer: 514785562499 < 514790755404
7 Halted 0 ms 0 KB -

Subtask #6
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 83704 KB contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 55 ms 83832 KB contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 364 ms 84264 KB contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 54 ms 84216 KB contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 410 ms 83832 KB contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 294 ms 83960 KB contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 304 ms 84364 KB contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 245 ms 84088 KB contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 265 ms 84224 KB contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 327 ms 84088 KB contestant found the optimal answer: 124309619349406845 == 124309619349406845