oj.uz

답안 #634112

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634112 2022-08-23T20:14:51 Z SOCIOPATE 수열 (APIO14_sequence) C++17
50 / 100
 2000 ms 32856 KB 
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

#define pll pair<ll, ll>
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define ff first
#define ss second
#define all(v) v.begin(),v.end()

typedef tree<
    int,
    null_type,
    less<int>,
    rb_tree_tag,
    tree_order_statistics_node_update> ordset;

#pragma GCC optimize("-O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-Os")

ll INF = 2e18;
ll mod = 1e9 + 7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll binpow(ll n, ll m){
    if(m == 0) return 1ll;
    if(m & 1ll) return n * binpow(n, m / 2ll);
    ll b = binpow(n, m / 2ll);
    return b*b;
}

void solve(){
    int n, k;
    cin >> n >> k;
    vector<ll> a(n), pref(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        pref[i] = (i ? pref[i - 1] : 0) + a[i];
    }
    vector<vector<ll>> dp(n, vector<ll>(k + 2, -INF)), pr(n, vector<ll>(k + 2, -1));
    auto sum = [&](int l, int r){
        return pref[r] - (l ? pref[l - 1] : 0);
    };
    for(int i = 0; i < n; i++) dp[i][1] = pref[i]*(pref[n - 1]-pref[i]);
    for(int i = 1; i < n; i++){
        for(int j = 2; j <= min(i + 1, k + 1); j++){
            for(int i1 = j - 2; i1 < i; i1++){
                ll newdp;
                if(i == n - 1 && j == k + 1) newdp = dp[i1][j - 1];
                else newdp = sum(i1 + 1, i)*sum(i + 1, n - 1) + dp[i1][j - 1];
                if(dp[i][j] < newdp){
                    pr[i][j] = i1;
                    dp[i][j] = newdp;
                }
            }
        }
    }
    vector<int> ans;
    int lst = n - 1;
    for(int i = k + 1; i >= 2; i--){
        lst = pr[lst][i];
        ans.push_back(lst);
    }
    cout << dp[n - 1][k + 1] << '\n';
    reverse(all(ans));
    for(int u : ans) cout << u + 1 << ' ';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        //freopen("output.txt", "w", stdout);
    #endif
	int tt;
    //cin >> tt;
	tt = 1;
	while (tt--) {
        solve();
		//solve();
		#ifdef LOCAL
            cout << "__________________________________" << endl;
		#endif
	}
	#ifdef LOCAL
        cout << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << "sec" << '\n';
	#endif
	return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 468 KB contestant found the optimal answer: 21503404 == 21503404
2 Correct 4 ms 468 KB contestant found the optimal answer: 140412195 == 140412195
3 Correct 265 ms 3540 KB contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 5 ms 468 KB contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 377 ms 3564 KB contestant found the optimal answer: 679388326 == 679388326
6 Correct 329 ms 3088 KB contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 261 ms 3572 KB contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 264 ms 3576 KB contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 77 ms 1060 KB contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 162 ms 1688 KB contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 604 ms 1884 KB contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 313 ms 1908 KB contestant found the optimal answer: 1326260195 == 1326260195
3 Execution timed out 2089 ms 32856 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

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