oj.uz

답안 #390903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
390903 2021-04-17T10:46:47 Z Vladth11 조교 (CEOI16_popeala) C++14
26 / 100
 2000 ms 20836 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debug_with_space(x) cerr << #x << " " << x << " "

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;
typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> OST;

const ll NMAX = 300001;
const ll INF = (1LL << 60);
const ll MOD = 998244353;
const ll BLOCK = 225;
const ll base = 31;
const ll nr_of_bits = 21;

int dp[20001][51];
int n, t, s;
int sum[20001];
int results[51][20001];
int last[51][20001];
int line[20001][51];
int minim[20001][51];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> t >> s;
    for(int i = 1; i <= t; i++) {
        cin >> sum[i];
        sum[i] += sum[i - 1];
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= t; j++) {
            last[i][j] = last[i][j - 1];
            char c;
            cin >> c;
            results[i][j] = c - '0';
            if(results[i][j] == 0)
                last[i][j] = j;
        }
    }
    for(int i = 0; i <= t; i++) {
        for(int j = 0; j <= s; j++)
            dp[i][j] = 2e9;
    }
    for(int i = 0; i <= t; i++){
        for(int j = 0; j <= n; j++){
            minim[i][j] = 2e9;
        }
    }
    dp[0][0] = 0;
    for(int k = 1; k <= s; k++){
        for(int i = 1; i <= t; i++){
            for(int j = 0; j <= n; j++){
                line[i][j] = dp[i - 1][k - 1] - sum[i - 1] * j;
                ///daca luam elementul i cu scor - j
                minim[i][j] = min(minim[i - 1][j], line[i][j]);
            }
        }
        for(int i = 1; i <= t; i++){
            priority_queue <int> events;
            for(int j = 1; j <= n; j++){
                events.push(last[j][i]);
            }
            int scor = n, r = i;
            for(int j = n; j >= 0; j--){
                while(events.size() && scor > j){
                    scor--;
                    r = events.top();
                    events.pop();
                }
                while(events.size() && events.top() >= r){
                    scor--;
                    r = events.top();
                    events.pop();
                }
                if(scor == j){
                    dp[i][k] = min(dp[i][k], minim[r][j] + sum[i] * j);
                }
            }
        }
        cout << dp[t][k] << "\n";
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 1232 KB Output is correct
2 Correct 67 ms 1232 KB Output is correct
3 Correct 76 ms 1240 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 370 ms 2888 KB Output is correct
2 Correct 464 ms 3784 KB Output is correct
3 Correct 571 ms 4720 KB Output is correct

Subtask #4
0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 74 ms 1232 KB Output is correct
4 Correct 67 ms 1232 KB Output is correct
5 Correct 76 ms 1240 KB Output is correct
6 Correct 370 ms 2888 KB Output is correct
7 Correct 464 ms 3784 KB Output is correct
8 Correct 571 ms 4720 KB Output is correct
9 Correct 756 ms 7564 KB Output is correct
10 Correct 1215 ms 9556 KB Output is correct
11 Execution timed out 2057 ms 20836 KB Time limit exceeded
12 Halted 0 ms 0 KB -