oj.uz

Submission #962401

# Submission time Handle Problem Language Result Execution time Memory
962401 2024-04-13T12:55:14 Z RaresFelix Aliens (IOI16_aliens) C++17
12 / 100
 127 ms 2644 KB 
#include <bits/stdc++.h>
#include "aliens.h"
//#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2,fma")

#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using namespace std;
using ll = long long;
using ld = long double;  // or double, if TL is tight
using str = string;
using ii = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

ll take_photos(int n0, int m, int k, vi r, vi c) {
    vector<ii> SegInit;
    for(int i = 0; i < n0; ++i) {
        SegInit.push_back({min(r[i], c[i]), max(r[i], c[i]) + 1});
    }
    sort(all(SegInit), [&](auto a, auto b) {
        if(a.first != b.first) return a < b;
        return a > b;
    });
    vector<ii> Seg;
    int cur_dr = -1;
    for(auto [st, dr] : SegInit) {
        if(dr <= cur_dr) continue;
        else {
            Seg.push_back({st, dr});
            cur_dr = dr;
        }
    }
    int n = Seg.size();
    vll st(n, 0), dr(n, 0), sb(n, 0);
    for(int i = 0; i < n; ++i) {
        st[i] = Seg[i].first; dr[i] = Seg[i].second;
        if(i) {
            sb[i] = (dr[i] - st[i]) * (dr[i] - st[i]);
            if(dr[i - 1] > st[i]) 
                sb[i] -= (dr[i - 1] - st[i]) * (dr[i - 1] - st[i]);
            sb[i] += sb[i - 1];
        }
    }
    auto cost = [&](int i, int j) {
        return (dr[j] - st[i]) * (dr[j] - st[i]) - (dr[i] - st[i]) * (dr[i] - st[i])
            - sb[j] + sb[i];

        return dr[j] * dr[j] - sb[j] + 2 * st[i] * dr[i] 
            - dr[i] * dr[i] + sb[i] - 2 * st[i] * dr[j];
    };
    ll re0 = 0;
    for(int i = 0; i < n; ++i) re0 += (dr[i] - st[i]) * (dr[i] - st[i]);

    const ll INF = 1e16;
    vector<vector<ll> > DP(n, vector(k + 1, INF));
    for(int i = 0; i < n; ++i) {
        DP[i][1] = cost(0, i);
        for(int j = 2; j <= k; ++j) {
            for(int p = 1; p <= i; ++p)
                DP[i][j] = min(DP[i][j], DP[p - 1][j - 1] + cost(p, i));
        }
    }
    ll re = INF;
    for(auto it : DP[n - 1]) re = min(re, it);
    re += re0;
    return re;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 344 KB Correct answer: answer = 4
4 Incorrect 0 ms 348 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 1
2 Correct 1 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 348 KB Correct answer: answer = 1
4 Correct 1 ms 344 KB Correct answer: answer = 5
5 Correct 0 ms 348 KB Correct answer: answer = 41
6 Correct 0 ms 348 KB Correct answer: answer = 71923
7 Correct 1 ms 344 KB Correct answer: answer = 77137
8 Correct 38 ms 1224 KB Correct answer: answer = 764
9 Correct 1 ms 348 KB Correct answer: answer = 250000
10 Correct 127 ms 2644 KB Correct answer: answer = 500
11 Correct 0 ms 348 KB Correct answer: answer = 32
12 Correct 1 ms 348 KB Correct answer: answer = 130050
13 Correct 11 ms 604 KB Correct answer: answer = 5110
14 Correct 2 ms 344 KB Correct answer: answer = 2626
15 Correct 5 ms 604 KB Correct answer: answer = 796
16 Correct 9 ms 616 KB Correct answer: answer = 7580
17 Correct 30 ms 860 KB Correct answer: answer = 1904
18 Correct 1 ms 348 KB Correct answer: answer = 996004
19 Correct 3 ms 348 KB Correct answer: answer = 38817
20 Correct 17 ms 756 KB Correct answer: answer = 4096
21 Correct 1 ms 344 KB Correct answer: answer = 1
22 Correct 1 ms 348 KB Correct answer: answer = 1
23 Correct 30 ms 860 KB Correct answer: answer = 2040
24 Correct 0 ms 348 KB Correct answer: answer = 2

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 344 KB Correct answer: answer = 4
4 Incorrect 0 ms 348 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 344 KB Correct answer: answer = 4
4 Incorrect 0 ms 348 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 344 KB Correct answer: answer = 4
4 Incorrect 0 ms 348 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -

Subtask #6
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Correct answer: answer = 4
2 Correct 0 ms 348 KB Correct answer: answer = 4
3 Correct 0 ms 344 KB Correct answer: answer = 4
4 Incorrect 0 ms 348 KB Wrong answer: output = 13, expected = 12
5 Halted 0 ms 0 KB -