oj.uz

Submission #595027

# Submission time Handle Problem Language Result Execution time Memory
595027 2022-07-13T09:13:55 Z Valaki2 Aliens (IOI16_aliens) C++14
12 / 100
 327 ms 4264 KB 
#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;

#define n N
#define m M
#define k K

#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int inf = 1e9 + 42;

int n, m, k;
vector<int> a, b;

int solve() {
    vector<bool> v(1 + m, false);
    v[0] = true;
    for(int i = 0; i < n; i++) {
        v[a[i] + 1] = true;
    }
    vector<int> prv(1 + m, 0);
    for(int i = 1; i <= m; i++) {
        if(v[i]) {
            prv[i] = i;
        } else {
            prv[i] = prv[i - 1];
        }
    }
    vector<vector<int> > dp(1 + m, vector<int> (1 + k, inf));
    dp[0][0] = 0;
    for(int j = 1; j <= k; j++) {
        dp[0][j] = 0;
        for(int i = 1; i <= m; i++) {
            dp[i][j] = dp[i][j - 1];
            for(int l = 0; l <= i; l++) {
                dp[i][j] = min(dp[i][j], dp[prv[l]][j - 1] + (i - l) * (i - l));
            }
            dp[i][j] = min(dp[i][j], dp[prv[i]][j]);
        }
    }
    int ans = inf;
    for(int j = 0; j <= k; j++) {
        ans = min(ans, dp[m][j]);
    }
    return ans;
}

#undef n
#undef m
#undef k
int take_photos(signed n, signed m, signed k, vector<signed> r, vector<signed> c) {
    N = n;
    M = m;
    K = k;
    a.assign(N, 0);
    b.assign(N, 0);
    for(int i = 0; i < N; i++) {
        a[i] = r[i];
        b[i] = c[i];
    }
    return solve();
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Wrong answer: output = 1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Correct answer: answer = 1
2 Correct 0 ms 212 KB Correct answer: answer = 4
3 Correct 0 ms 212 KB Correct answer: answer = 1
4 Correct 0 ms 212 KB Correct answer: answer = 5
5 Correct 0 ms 212 KB Correct answer: answer = 41
6 Correct 4 ms 340 KB Correct answer: answer = 71923
7 Correct 9 ms 340 KB Correct answer: answer = 77137
8 Correct 208 ms 2300 KB Correct answer: answer = 764
9 Correct 1 ms 340 KB Correct answer: answer = 250000
10 Correct 121 ms 2260 KB Correct answer: answer = 500
11 Correct 1 ms 212 KB Correct answer: answer = 32
12 Correct 2 ms 340 KB Correct answer: answer = 130050
13 Correct 10 ms 468 KB Correct answer: answer = 5110
14 Correct 2 ms 340 KB Correct answer: answer = 2626
15 Correct 5 ms 424 KB Correct answer: answer = 796
16 Correct 9 ms 456 KB Correct answer: answer = 7580
17 Correct 31 ms 812 KB Correct answer: answer = 1904
18 Correct 2 ms 340 KB Correct answer: answer = 996004
19 Correct 19 ms 468 KB Correct answer: answer = 38817
20 Correct 82 ms 1108 KB Correct answer: answer = 4096
21 Correct 1 ms 212 KB Correct answer: answer = 1
22 Correct 319 ms 4264 KB Correct answer: answer = 1
23 Correct 24 ms 724 KB Correct answer: answer = 2040
24 Correct 327 ms 4264 KB Correct answer: answer = 2

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Wrong answer: output = 1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Wrong answer: output = 1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Wrong answer: output = 1, expected = 4
2 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Wrong answer: output = 1, expected = 4
2 Halted 0 ms 0 KB -