Submission #1284693

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284693		gustavo_d	Aliens (IOI16_aliens)	C++20	25 / 100	113 ms	2404 KiB

aliens

#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAXN = 500;
const ll INFLL = 1e18;

ll dp[MAXN+1][MAXN+1];
pair<int, int> all[MAXN];

ll take_photos(int n, int m, int k, vector<int> rows, vector<int> cols) {
    for (int i=0; i<n; i++) {
        if (rows[i] > cols[i])
            swap(rows[i], cols[i]);
        all[i] = {rows[i], -cols[i]};
    }
    sort(all, all+n);
    for (int i=0; i<n; i++) all[i].second = -all[i].second;

    vector<ll> l{-1}, r{-1}; int mx = -1;
    for (int i=0, N = n; i<N; i++) {
        if (i > 0 and all[i].first == all[i-1].first) {
            n--;
            continue;
        }
        if (all[i].second <= mx) {
            n--;
            continue;
        }
        l.push_back(all[i].first);
        r.push_back(all[i].second);
        mx = all[i].second;
    }

    // for (int i=1; i<=n; i++) cout << l[i] << ' ' << r[i] << '\n';
    // cout << '\n';

    dp[0][0] = 0;
    for (int i=1; i<=n; i++) dp[i][0] = INFLL;
    for (int i=1; i<=n; i++) {
        for (int ops=1; ops<=k; ops++) {
            dp[i][ops] = dp[i][ops-1];
            // cout << i << ':';
            for (int j=i; j>=1; j--) {
                ll res = dp[j-1][ops-1];
                res += (r[i] - l[j] + 1) * (r[i] - l[j] + 1);
                // if (i == 2 and j == 2) cout << (r[j-1] - l[j] + 1) << endl;
                if (j > 1 and (r[j-1] - l[j] + 1) > 0)
                    res -= (r[j-1] - l[j] + 1) * (r[j-1] - l[j] + 1);

                // cout << res << ' ';
                dp[i][ops] = min(dp[i][ops], res);
            }
            // cout << '\n';
        }
    }

    return dp[n][k];
}

Compilation message (stderr)

aliens.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
aliens_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 9 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 40