oj.uz

답안 #37919

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
37919 2017-12-29T03:25:36 Z Just_Solve_The_Problem K개의 묶음 (IZhO14_blocks) C++11
0 / 100
 326 ms 12172 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int N = (int)1e5 + 7;
const ll linf = (ll)1e15 + 7;

ll dp[2][N];
int ar[N];
int numlog[N];
int table[20][N];
int n;

void buildtable () {
    for (int i = 2; i <= n; i++) {
        numlog[i] = numlog[i / 2] + 1;
    }
    for (int i = 0; i <= numlog[n]; i++) {
        int curlen = 1 << i;
        for (int j = 1; j <= n; j++) {
            if (i == 0) {
                table[i][j] = ar[j];
                continue;
            }
            table[i][j] = max(table[i - 1][j], table[i - 1][j + curlen / 2]);
        }
    }
}

ll get (int l, int r) {
    if (l > r) return linf;
    int curlog = numlog[r - l + 1];
    return max(table[curlog][l], table[curlog][r - (1 << curlog) + 1]);
}

void div (int k, int l, int r, int optl, int optr) {
    if (l > r) return ;
    int mid = (l + r) >> 1;
    int opt = optl;
    dp[k & 1][mid] = linf;
    for (int i = optl; i <= min(mid, optr); i++) {
        ll cur = dp[k & 1 ^ 1][i] + get(i + 1, mid);
        if (cur < dp[k & 1][mid]) {
            dp[k & 1][mid] = cur;
            opt = i;
        }
    }
    div(k, l, mid - 1, optl, opt);
    div(k, mid + 1, r, opt, optr);
}

main() {
    int k;
    scanf ("%d %d", &n, &k);
    for (int i = 1; i <= n; i++) {
        scanf ("%d", ar + i);
    }
    buildtable();
    for (int i = 0; i <= n; i++) {
        dp[0][i] = linf;
    }
    for (int i = 1; i <= n; i++) {
        dp[1][i] = get(1, i);
    }
//    cout << get(1, n) << endl;
//    for (int i = 1; i <= n; i++) {
//        cout << dp[1][i] << ' ';
//    }
//    puts("");
    for (int i = 2; i <= k; i++) {
        div(i, 1, n, 1, n - 1);
//        for (int j = 1; j <= n; j++) {
//            cout << dp[i & 1][j] << ' ';
//        }
//        puts("");
    }
    cout << dp[k & 1][n];
}

Compilation message

blocks.cpp: In function 'void div(int, int, int, int, int)':
blocks.cpp:44:23: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
         ll cur = dp[k & 1 ^ 1][i] + get(i + 1, mid);
                       ^
blocks.cpp: At global scope:
blocks.cpp:54:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
blocks.cpp: In function 'int main()':
blocks.cpp:56:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d", &n, &k);
                            ^
blocks.cpp:58:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d", ar + i);
                             ^

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 12172 KB Output is correct
2 Correct 0 ms 12172 KB Output is correct
3 Correct 0 ms 12172 KB Output is correct
4 Correct 0 ms 12172 KB Output is correct
5 Correct 0 ms 12172 KB Output is correct
6 Correct 0 ms 12172 KB Output is correct
7 Correct 0 ms 12172 KB Output is correct
8 Correct 0 ms 12172 KB Output is correct
9 Correct 0 ms 12172 KB Output is correct
10 Correct 0 ms 12172 KB Output is correct
11 Incorrect 0 ms 12172 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 12172 KB Output is correct
2 Correct 0 ms 12172 KB Output is correct
3 Correct 0 ms 12172 KB Output is correct
4 Correct 0 ms 12172 KB Output is correct
5 Correct 0 ms 12172 KB Output is correct
6 Correct 0 ms 12172 KB Output is correct
7 Correct 0 ms 12172 KB Output is correct
8 Correct 0 ms 12172 KB Output is correct
9 Correct 0 ms 12172 KB Output is correct
10 Correct 0 ms 12172 KB Output is correct
11 Incorrect 0 ms 12172 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 12172 KB Output is correct
2 Correct 3 ms 12172 KB Output is correct
3 Correct 33 ms 12172 KB Output is correct
4 Incorrect 326 ms 12172 KB Output isn't correct
5 Halted 0 ms 0 KB -