Submission #77685

#	Time	Username	Problem	Language	Result	Execution time	Memory
77685		duality	Popeala (CEOI16_popeala)	C++11	100 / 100	378 ms	16384 KiB

popeala

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int p[20001];
char r[50][20000];
int t[51],c[50];
int sorted[20000][50];
int dp[51][20001];
int main() {
    int i,j;
    int N,T,S;
    scanf("%d %d %d",&N,&T,&S);
    for (i = 0; i < T; i++) scanf("%d",&p[i+1]),p[i+1] += p[i];
    for (i = 0; i < N; i++) {
        for (j = 0; j < T; j++) scanf(" %c",&r[i][j]);
    }

    for (i = 0; i < N; i++) t[i] = -1;
    for (i = 0; i < T; i++) {
        for (j = 0; j < N; j++) {
            if (r[j][i] == '0') t[j] = i;
            sorted[i][j] = t[j];
        }
        sort(sorted[i],sorted[i]+N);
    }
    int k;
    dp[0][0] = 0;
    for (i = 1; i <= T; i++) dp[0][i] = MAX_VAL;
    for (i = 1; i <= S; i++) {
        for (j = 0; j <= N; j++) t[j] = MAX_VAL,c[j] = 0;
        dp[i][0] = MAX_VAL;
        for (j = 1; j <= T; j++) {
            for (k = 0; k < N; k++) {
                while (c[k] <= sorted[j-1][k]) t[k] = min(t[k],dp[i-1][c[k]]-k*p[c[k]]),c[k]++;
            }
            t[N] = min(t[N],dp[i-1][j-1]-N*p[j-1]);
            int m = MAX_VAL;
            for (k = 0; k <= N; k++) m = min(m,k*p[j]+t[k]);
            dp[i][j] = m;
        }
        printf("%d\n",dp[i][T]);
    }

    return 0;
}

Compilation message (stderr)

popeala.cpp: In function 'int main()':
popeala.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&N,&T,&S);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
popeala.cpp:67:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < T; i++) scanf("%d",&p[i+1]),p[i+1] += p[i];
                             ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
popeala.cpp:69:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for (j = 0; j < T; j++) scanf(" %c",&r[i][j]);
                                 ~~~~~^~~~~~~~~~~~~~~~

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