Submission #439974

#	Time	Username	Problem	Language	Result	Execution time	Memory
439974		elazarkoren	Colouring a rectangle (eJOI19_colouring)	C++17	20 / 100	2085 ms	102404 KiB

colouring

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <bitset>
#define chkmin(a, b) a = min(a, b)
#define x first
#define y second
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef vector<vb> vvb;

const ll infinity = 1e18;

const int MAX_N = 4e5 + 1;

ll ans = infinity;

int n, m;

vi dig1, dig2;

void Solve(int i, ll sum, vi &visited, vvi &graph) {
    if (i == n + m - 1) {
        chkmin(ans, sum);
        return;
    }
    int count = 0;
    for (int neighbor : graph[i]) {
        if (!visited[neighbor]) {
            sum += dig2[neighbor];
            count++;
        }
        visited[neighbor]++;
    }
    Solve(i + 1, sum, visited, graph);
    for (int neighbor : graph[i]) {
        visited[neighbor]--;
        if (!visited[neighbor]) {
            sum -= dig2[neighbor];
        }
    }
    if (count) {
        Solve(i + 1, sum + dig1[i], visited, graph);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    dig1.resize(n + m - 1), dig2.resize(n + m - 1);
    for (int i = 0; i < m + n - 1; i++) {
        cin >> dig1[i];
    }
    for (int i = 0; i < n + m - 1; i++) {
        cin >> dig2[i];
    }
    vvi graph(m + n - 1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            graph[i - j + m - 1].push_back(i + j);
        }
    }
    for (int i = 0; i < m + n - 1; i++) {
        sort(all(graph[i]));
        graph[i].erase(unique(all(graph[i])), graph[i].end());
    }
    vi visited(n + m - 1);
    Solve(0, 0, visited, graph);
    cout << ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 20
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20