Submission #1114906

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114906		codexistent	Domino (COCI15_domino)	C++14	140 / 160	4067 ms	217196 KiB

domino

#include <bits/stdc++.h>
using namespace std;
#define MAXN 2005
#define ll long long
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define fs first
#define sc second

ll r, s = 0;
int n, k, g[MAXN][MAXN], m;
vector<pair<ll, pair<pair<int, int>, bool>>> d;
bool v[MAXN][MAXN];

void recurse(int itr = 0, int i = -1, ll sm = 0){
    if(itr == k){
        r = min(r, s - sm);
        return;
    }

    FOR(i2, i + 1, m - 1){
        if(v[d[i2].sc.fs.fs][d[i2].sc.fs.sc] || v[d[i2].sc.fs.fs + !d[i2].sc.sc][d[i2].sc.fs.sc + d[i2].sc.sc]){
            continue;
        }
        v[d[i2].sc.fs.fs][d[i2].sc.fs.sc] = true;
        v[d[i2].sc.fs.fs + !d[i2].sc.sc][d[i2].sc.fs.sc + d[i2].sc.sc] = true;

        recurse(itr + 1, i2, sm + d[i2].fs);

        v[d[i2].sc.fs.fs][d[i2].sc.fs.sc] = false;
        v[d[i2].sc.fs.fs + !d[i2].sc.sc][d[i2].sc.fs.sc + d[i2].sc.sc] = false;
    }
}

int main(){
    cin >> n >> k;
    FOR(i, 1, n) FOR(j, 1, n) {
        cin >> g[i][j];
        v[i][j] = false;
        s += g[i][j];
    }
    r = s;

    FOR(i, 1, n) FOR(j, 1, n) {
        if(i != n) d.push_back({g[i][j] + g[i + 1][j], {{i, j}, 0}});
        if(j != n) d.push_back({g[i][j] + g[i][j + 1], {{i, j}, 1}});
    }
    sort(begin(d), end(d));
    reverse(begin(d), end(d));

    m = min((k - 1) * 7 + 1, 2 * n * (n - 1));
    recurse();

    cout << r << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10
• Subtask 11: 10 / 10
• Subtask 12: 10 / 10
• Subtask 13: 10 / 10
• Subtask 14: 0 / 10
• Subtask 15: 10 / 10
• Subtask 16: 0 / 10