oj.uz

Submission #254042

# Submission time Handle Problem Language Result Execution time Memory
254042 2020-07-29T09:21:50 Z Vimmer Domino (COCI15_domino) C++14
70 / 160
 4000 ms 163160 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100050
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 5> a5;

//typedef tree <ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int ans = 0;

int n, k, a[2001][2001], mk[2001][2001], mx;

vector <pair <int, pair <int, pair <int, int> > > > vr;

inline void dfs(int v, int &kol)
{
    if (v == k) {ans = max(ans, kol); return;}

    for (int i = 0; i < min(mx, sz(vr)); i++)
    {
        int x = vr[i].S.S.F, y = vr[i].S.S.S;

        int nkol = kol;

        if (mk[x][y] == 0) nkol += a[x][y];

        if (vr[i].S.F == 0 && !mk[x - 1][y]) nkol += a[x - 1][y];

        if (vr[i].S.F == 1 && !mk[x][y - 1]) nkol += a[x][y - 1];

        mk[x][y]++;

        if (vr[i].S.F == 0) mk[x - 1][y]++; else mk[x][y - 1]++;

        dfs(v + 1, nkol);

        mk[x][y]--;

        if (vr[i].S.F == 0) mk[x - 1][y]--; else mk[x][y - 1]--;
    }
}
int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> k;

    if (k <= 5) mx = 30;
      else if (k == 6) mx = 22;
       else if (k == 7) mx = 13;
         else mx = 10;

    ll sum = 0;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) {cin >> a[i][j]; sum += ll(a[i][j]);}

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        {
            if (i != 0) vr.pb({a[i][j] + a[i - 1][j], {0, {i, j}}});

            if (j != 0) vr.pb({a[i][j] + a[i][j - 1], {1, {i, j}}});
        }

    sort(vr.begin(), vr.end());

    reverse(vr.begin(), vr.end());

    int nkol = 0;

    dfs(0, nkol);

    cout << sum - ll(ans) << endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 11760 KB Output is correct
2 Correct 82 ms 11624 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 896 KB Output is correct
2 Correct 1 ms 768 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1840 ms 147544 KB Output is correct
2 Correct 1281 ms 147672 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1064 ms 143704 KB Output is correct
2 Correct 915 ms 143600 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 450 ms 41168 KB Output is correct
2 Correct 305 ms 41168 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2272 ms 147412 KB Output is correct
2 Correct 1661 ms 147416 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3121 ms 904 KB Output is correct
2 Incorrect 3193 ms 888 KB Output isn't correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4097 ms 147412 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1811 ms 1408 KB Output is correct
2 Incorrect 1835 ms 1536 KB Output isn't correct

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1790 ms 416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3697 ms 147544 KB Output is correct
2 Incorrect 3140 ms 163160 KB Output isn't correct

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2898 ms 1056 KB Output is correct
2 Incorrect 2923 ms 1044 KB Output isn't correct

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3236 ms 41188 KB Output is correct
2 Incorrect 3155 ms 45136 KB Output isn't correct

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2840 ms 428 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4030 ms 147548 KB Time limit exceeded
2 Halted 0 ms 0 KB -