oj.uz

답안 #129579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129579 2019-07-12T15:15:48 Z I_Hate_AHDPIYKO 조교 (CEOI16_popeala) C++17
8 / 100
 1828 ms 1016 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;

#define ll long long
#define lll __int128
#define ull unsigned long long
#define fi first
#define se second
#define db double
#define ld long double
#define lld __float128

/// order_of_key, find_by_order

template<class T, class COMP>
using custom_set = tree<T, null_type, COMP, rb_tree_tag, tree_order_statistics_node_update>;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

template<class T, class U>
using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rnd_64(chrono::steady_clock::now().time_since_epoch().count());

const int MAXT = 20005;

bool slv[55][MAXT];

ll tr[MAXT*4], psh[MAXT*4], dp[MAXT][55], val[MAXT];
int ls[55];

void push(int v, int l, int r)
{
    if(!psh[v])
        return;
    tr[v] += psh[v];
    if(l != r)
    {
        psh[v*2] += psh[v];
        psh[v*2+1] += psh[v];
    }
    psh[v] = 0;
}

void Add(int l, int r, int L, int R, int v, ll x)
{
    if(l >= L && r <= R)
    {
        psh[v] += x;
        push(v, l, r);
        return;
    }
    push(v, l, r);
    if(l > R || r < L)
        return;
    int m = (l+r) / 2;
    Add(l, m, L, R, v*2, x);
    Add(m+1, r, L, R, v*2+1, x);
    tr[v] = min(tr[v*2], tr[v*2+1]);
}

ll Min(int l, int r, int L, int R, int v)
{
    if(l >= L && r <= R)
    {
        push(v, l, r);
        return tr[v];
    }
    if(l > R || r < L)
        return 1e18;
    push(v, l, r);
    int m = (l+r) / 2;
    return min(Min(l, m, L, R, v*2), Min(m+1, r, L, R, v*2+1));
}

void Build(int l, int r, int v)
{
    if(l == r)
    {
        tr[v] = 0;
        psh[v] = 0;
        return;
    }
    int m = (l+r) / 2;
    Build(l, m, v*2);
    Build(m+1, r, v*2+1);
    tr[v] = psh[v] = 0;
}

int main()
{
    int n, t, s; cin >> n >> t >> s;
    for(int i = 0; i < t; i++)
    {
        cin >> val[i];
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < t; j++)
        {
            char ch; cin >> ch;
            slv[i][j] = (ch == '1');
        }
    }
    for(int i = 1; i <= t; i++)
    {
        dp[0][i] = 1e18;
    }
    for(int j = 1; j <= s; j++)
    {
        for(int i = 0; i < n; i++)
        {
            ls[i] = 0;
        }
        Build(0, t, 1);
        dp[j][0] = 1e18;
        for(int i = 0; i < t; i++)
        {
            Add(0, t, i, i, 1, dp[j-1][i]);
            for(int x = 0; x < n; x++)
            {
                if(slv[x][i])
                {
                    Add(0, t, ls[x], i, 1, val[i]);
                }
                else
                {
                    ll sm = 0;
                    for(int ps = i-1; ps >= ls[x]; ps--)
                    {
                        sm += val[ps];
                        Add(0, t, ps, ps, 1, -sm);
                    }
                    ls[x] = i+1;
                }
            }
            dp[j][i+1] = min(Min(0, t, 0, i, 1), (ll)1e18);
        }
//        for(int i = 0; i <= t; i++)
//        {
//            cout << dp[j][i] << ' ';
//        } cout << '\n';
        cout << dp[j][t] << '\n';
    }
}






































/// shche ne vmerla Ykraina

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Incorrect 358 ms 732 KB Output isn't correct
4 Halted 0 ms 0 KB -