oj.uz

Submission #116655

# Submission time Handle Problem Language Result Execution time Memory
116655 2019-06-13T11:01:09 Z JohnTitor Popeala (CEOI16_popeala) C++11
17 / 100
 2000 ms 3712 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "Popeala"
int n, t, h;
ll s[20001];
ll x[20001];
string p[51];
int nf[51][20001];
ll nc[51][50001];
ll f[20001];
ll g[20001];
int main(){
    #ifdef Aria
        if(fopen(taskname".in", "r"))
            freopen(taskname".in", "r", stdin);
    #endif // Aria
    read(n);
    read(t);
    read(h);
    FOR(i, 1, t) read(s[i]);
    FOR(i, 1, t) x[i]=x[i-1]+s[i];
    FOR(i, 1, n){
        cin>>p[i];
        p[i]='0'+p[i];
        nf[i][t]=t+1;
        DFOR(j, t-1, 0) if(p[i][j+1]=='0') nf[i][j]=j+1;
        else nf[i][j]=nf[i][j+1];
    }
    FOR(i, 1, t) f[i]=1e18;
    g[0]=1e18;
    FOR(used, 1, h){
        FOR(i, 0, n) FOR(j, 0, t) nc[i][j]=1e18;
        FFOR(i, 0, t) if(f[i]<1e18){
            int cnt=n;
            vector <int> alive;
            FOR(j, 1, n) alive.pb(j);
            int now=i;
            bool first=1;
            while(!alive.empty()){
                nc[alive.size()][now+first]=min(nc[alive.size()][now+first], (ll)(f[i]-x[i]*alive.size()));
                int nxdeath=t+1;
                for(int x: alive) nxdeath=min(nxdeath, nf[x][now]);
                vector <int> nalive;
                for(int x: alive) if(nf[x][now]>nxdeath) nalive.pb(x);
                alive=nalive;
                now=nxdeath;
                first=0;
            }
            if(now<=t) nc[0][now]=min(nc[0][now], f[i]);
        }
        FOR(i, 0, t) f[i]=1e18;
        FOR(c, 0, n){
            FOR(i, 1, t){
                nc[c][i]=min(nc[c][i], nc[c][i-1]);
                f[i]=min(f[i], x[i]*c+nc[c][i]);
            }
        }
        writeln(f[t]);
//        FOR(i, 0, t) cerr<<f[i]<<" \n"[i==t];
    }
}

Compilation message

popeala.cpp: In function 'int main()':
popeala.cpp:50:17: warning: unused variable 'cnt' [-Wunused-variable]
             int cnt=n;
                 ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 254 ms 1184 KB Output is correct
2 Correct 258 ms 1152 KB Output is correct
3 Correct 259 ms 1272 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1323 ms 2240 KB Output is correct
2 Correct 1719 ms 2908 KB Output is correct
3 Execution timed out 2061 ms 3712 KB Time limit exceeded

Subtask #4
0 / 74.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 254 ms 1184 KB Output is correct
4 Correct 258 ms 1152 KB Output is correct
5 Correct 259 ms 1272 KB Output is correct
6 Correct 1323 ms 2240 KB Output is correct
7 Correct 1719 ms 2908 KB Output is correct
8 Execution timed out 2061 ms 3712 KB Time limit exceeded