Submission #1159703

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159703		InvMOD	Colouring a rectangle (eJOI19_colouring)	C++20	0 / 100	2096 ms	9900 KiB

colouring

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define gcd __gcd
#define sz(v) (int) v.size()
#define pb push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REV(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) "[" #x " = " << (x) << "]"
///#define int long long

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template<typename T> bool ckmx(T& a, const T& b){if(a < b) return a = b, true; return false;}
template<typename T> bool ckmn(T& a, const T& b){if(a > b) return a = b, true; return false;}

const int N = 2e5+5;
const ll MOD = 1e9+7;
const ll INF = 1e15;

struct Item{
    int l, r; ll c;
    Item(int l = 0, int r = 0, ll c = 0): l(l), r(r), c(c) {}
};

int n, m, w[2][N];

ll val[2][N], dp[2][N], pref[N];

vector<Item> cross[2];

void calc_dp(vector<Item>& cross, ll val[], ll dp[]){
    dp[0] = 0;
    FOR(i, 1, n + m - 1){
        dp[i] = INF;
    }

    FOR(i, 1, n + m - 1){
        pref[i] = pref[i - 1] + val[i];
    }

    sort(all(cross), [&](Item x, Item y){
            return x.r < y.r;
    });

    FOR(i, 1, sz(cross) - 1){
        int curL = cross[i].l, curR = cross[i].r;

        ll sum = 0;
        for(int j = i; j >= 1; j--){
            ckmn(curL, cross[j].l);
            ckmx(curR, cross[j].r);
            sum = sum + cross[j].c;

            dp[i] = min(dp[i], dp[j - 1] + sum);
            dp[i] = min(dp[i], dp[j - 1] + (pref[curR] - pref[curL - 1]));
        }
    }

    return;
}

void solve()
{
    cin >> n >> m;

    FOR(j, 0, 1){
        FOR(i, 1, n + m - 1){
            cin >> w[j][i];
        }
        cross[j].push_back(Item(-1, -1, 0));
    }

    FOR(i, 1, n + m - 1){
        int l,r;

        if(i <= n){
            l = n - i + 1;
        }
        else l = i - m;

        if(i <= m){
            r = i + n - 1;
        }
        else r = n + m - (i - m);
        l = (l + 1) / 2;
        r = (r + 1) / 2;
        cross[(i & 1)].push_back(Item(l, r, w[0][i]));
    }

    FOR(i, 1, n + m - 1){
        int idx = (i + 1) / 2;
        val[(i & 1) == (n & 1)][idx] = w[1][i];
    }

    calc_dp(cross[0], val[0], dp[0]);
    calc_dp(cross[1], val[1], dp[1]);

    cout << dp[0][sz(cross[0]) - 1] + dp[1][sz(cross[1]) - 1] << "\n";
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    #define name "InvMOD"
    if(fopen(name".INP", "r")){
        freopen(name".INP","r",stdin);
        freopen(name".OUT","w",stdout);
    }

    int t = 1; //cin >> t;
    while(t--) solve();
    return 0;
}

Compilation message (stderr)

colouring.cpp: In function 'int main()':
colouring.cpp:117:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |         freopen(name".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
colouring.cpp:118:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         freopen(name".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 20
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20