oj.uz

Submission #77673

# Submission time Handle Problem Language Result Execution time Memory
77673 2018-09-29T17:32:57 Z duality Popeala (CEOI16_popeala) C++11
17 / 100
 2000 ms 1508 KB 
#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];
int pre[50][20001];
int dp[51][20001];
int findAns(int i,int l,int r,int al,int ar,int N)  {
    if (l > r) return 0;
    int j,k;
    int m = (l+r) / 2,am = al;
    dp[i][m] = MAX_VAL;
    for (j = al; j <= min(ar,m-1); j++) {
        int s = dp[i-1][j];
        for (k = 0; k < N; k++) s += (pre[k][m] == pre[k][j]) ? (p[m]-p[j]):0;
        if (s <= dp[i][m]) dp[i][m] = s,am = j;
    }
    findAns(i,l,m-1,al,ar,N);
    findAns(i,m+1,r,al,ar,N);
    return 0;
}
int main() {
    int i,j;
    int N,T,S;
    char c;
    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",&c),pre[i][j+1] = pre[i][j] + (c == '0');
    }

    dp[0][0] = 0;
    for (i = 1; i <= T; i++) dp[0][i] = MAX_VAL;
    for (i = 1; i <= S; i++) {
        findAns(i,0,T,0,T,N);
        printf("%d\n",dp[i][T]);
    }

    return 0;
}

Compilation message

popeala.cpp: In function 'int findAns(int, int, int, int, int, int)':
popeala.cpp:64:23: warning: variable 'am' set but not used [-Wunused-but-set-variable]
     int m = (l+r) / 2,am = al;
                       ^~
popeala.cpp: In function 'int main()':
popeala.cpp:79: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:80: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:82:48: 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",&c),pre[i][j+1] = pre[i][j] + (c == '0');
                                 ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 628 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 560 ms 1116 KB Output is correct
2 Correct 555 ms 1232 KB Output is correct
3 Correct 493 ms 1292 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2045 ms 1508 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 74.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 628 KB Output is correct
3 Correct 560 ms 1116 KB Output is correct
4 Correct 555 ms 1232 KB Output is correct
5 Correct 493 ms 1292 KB Output is correct
6 Execution timed out 2045 ms 1508 KB Time limit exceeded
7 Halted 0 ms 0 KB -