Submission #947871

#	Time	Username	Problem	Language	Result	Execution time	Memory
947871		Darren0724	Popeala (CEOI16_popeala)	C++17	0 / 100	95 ms	2292 KiB

popeala

#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define endl '\n'
const int N=200005;
const int INF=1e18;
 
int32_t main() {
    LCBorz;
    int n,t,s;cin>>n>>t>>s;
    vector<int> v(t+1);
    for(int i=1;i<=t;i++){
        cin>>v[i];
        v[i]+=v[i-1];
    }
    vector pre(n,vector(t+1,0)),last(t+1,vector(n+2,0));
    for(int i=0;i<n;i++){
        for(int j=1;j<=t;j++){
            char c;cin>>c;
            pre[i][j]=c-'0'+pre[i][j-1];
            last[j][i]=(c=='0'?j:last[j-1][i]);
        }   
    }
    for(int j=1;j<=t;j++){
        last[j][n]=j;
        sort(all(last[j]));
    }
    vector dp(s+1,vector(t+1,INF));
    dp[0][0]=0;
    for(int i=1;i<=s;i++){
        deque<int> d[n+1];
        for(int j=1;j<=t;j++){
            for(int cnt=0;cnt<=n;cnt++){
                while(d[cnt].size()&&d[cnt].front()<last[j][cnt]){
                    d[cnt].pop_front();
                }
                for(int i1=last[j-1][cnt+1];i1<last[j][cnt+1];i1++){
                    while(d[cnt].size()&&dp[i-1][d[cnt].front()]>=dp[i-1][i1]){
                        d[cnt].pop_front();
                    }
                    d[cnt].push_back(i1);
                }
                if(d[cnt].size()){
                    dp[i][j]=min(dp[i][j],dp[i-1][d[cnt].front()]+cnt*v[j]-cnt*v[d[cnt].front()]);
                }
            }
        }
    }
    for(int i=1;i<=s;i++){
        cout<<dp[i][t]<<endl;
    }
 
    
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 74