oj.uz

Submission #1016528

# Submission time Handle Problem Language Result Execution time Memory
1016528 2024-07-08T07:43:13 Z GrindMachine Homecoming (BOI18_homecoming) C++17
13 / 100
 1000 ms 19804 KB 
#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;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "homecoming.h"

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
    	ll a;
    };

    data neutral = {-inf2};

    data merge(data &left, data &right) {
    	data curr;
    	curr.a = max(left.a,right.a);
    	return curr;
    }

    void create(int i, T v) {
    	tr[i].a = v;
    }

    void modify(int i, T v) {
    	tr[i].a = v;
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

ll solve(int n, int k, int *A, int *B){
	vector<ll> a(n), b(n);
	rep(i,n) a[i] = A[i], b[i] = B[i];
	ll initial = 0;
	rep(i,n) initial += a[i]-b[i];
	ll ans = 0;

	rep(cyc_shift,n){
		if(cyc_shift){
			rotate(a.begin(),a.begin()+1,a.end());
			rotate(b.begin(),b.begin()+1,b.end());
		}

		vector<ll> p(n);
		rep(i,n){
			p[i] = a[i]+(i?p[i-1]:0);
		}

		vector<ll> dp(n,-inf2);
		for(int i = k; i < n; ++i){
			dp[i] = b[i]-(p[i]-p[i-k]);
			rev(j,i-1,0){
				if(j > i-k){
					ll val = dp[j]-(p[i]-p[j])+b[i];
					amax(dp[i],val);
				}
				else{
					ll val = dp[j]-(p[i]-p[i-k])+b[i];
					amax(dp[i],val);
				}
			}
		}

		amax(ans,*max_element(all(dp)));

		// vector<ll> dp(n,-inf2);
		// vector<ll> pmx(n,-inf2);
		// segtree<ll> st(n);

		// for(int i = k; i < n; ++i){
		// 	dp[i] = b[i]-(p[i]-p[i-k]);
		// 	ll val1 = st.query(i-k+1,i-1).a+b[i]-p[i];
		// 	ll val2 = pmx[i-k]+b[i]-(p[i]-p[i-k]);
		// 	dp[i] = max({dp[i],val1,val2});
		// 	st.pupd(i,dp[i]+p[i]);
		// 	pmx[i] = max(pmx[i-1],dp[i]);
		// }

		// amax(ans,*max_element(all(dp)));

		// trav(x,a) cout << x << " ";
		// cout << endl;
		
		// trav(x,b) cout << x << " ";
		// cout << endl;
	}

	ans += initial;
	amax(ans,0ll);
	return ans;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 23 ms 480 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 58 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 23 ms 480 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 58 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 44 ms 604 KB Output is correct
7 Execution timed out 1038 ms 604 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 19804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 23 ms 480 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 58 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 44 ms 604 KB Output is correct
7 Execution timed out 1038 ms 604 KB Time limit exceeded
8 Halted 0 ms 0 KB -