oj.uz

Submission #939230

# Submission time Handle Problem Language Result Execution time Memory
939230 2024-03-06T07:11:49 Z gaga999 Domino (COCI15_domino) C++17
160 / 160
 659 ms 231968 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 4e6 + 6;
int hd[N], to[N * 3], nxt[N * 3], vl[N * 3], dp[N], fr[N], fe[N], s, t, ct = 1;
bool vd[N];

inline void adeg(int u, int v, int w)
{
    to[ct] = v, vl[ct] = w, nxt[ct] = hd[u], hd[u] = ct++;
}

signed main()
{
    int n, qq, x;
    rd(n, qq);
    s = n * n + 1, t = s + 1;
    llt ans = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            rd(x), ans += x;
            int id = i * n + j;
            if ((i + j) & 1)
            {
                adeg(s, id, x);
                if (i)
                    adeg(id, id - n, 0);
                if (j != 1)
                    adeg(id, id - 1, 0);
            }
            else
            {
                adeg(i * n + j, t, x);
                if (i)
                    adeg(id - n, id, 0);
                if (j != 1)
                    adeg(id - 1, id, 0);
            }
        }
    }
    while (qq--)
    {
        init(dp, NIF);
        queue<int> q;
        q.push(s), vd[s] = 1, dp[s] = 0;
        while (!q.empty())
        {
            x = q.front(), q.pop(), vd[x] = 0;
            for (int i = hd[x]; i; i = nxt[i])
            {
                const int v = to[i];
                if (dp[x] + vl[i] <= dp[v])
                    continue;
                dp[v] = dp[x] + vl[i], fr[v] = x, fe[v] = i;
                if (!vd[v])
                    q.push(v), vd[v] = 1;
            }
        }
        ans -= dp[t];
        for (int p = t; p != s; p = fr[p])
            adeg(p, fr[p], -vl[fe[p]]), vl[fe[p]] = -INF;
    }
    prt(ans), putchar('\n');
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 41048 KB Output is correct
2 Correct 12 ms 41048 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24924 KB Output is correct
2 Correct 4 ms 24924 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 216300 KB Output is correct
2 Correct 220 ms 231936 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 24920 KB Output is correct
2 Correct 5 ms 24920 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 132532 KB Output is correct
2 Correct 167 ms 139204 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 74232 KB Output is correct
2 Correct 74 ms 78360 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 451 ms 216184 KB Output is correct
2 Correct 336 ms 228044 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 24924 KB Output is correct
2 Correct 8 ms 25112 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 216284 KB Output is correct
2 Correct 383 ms 231804 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 24924 KB Output is correct
2 Correct 14 ms 16716 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24924 KB Output is correct
2 Correct 9 ms 24924 KB Output is correct

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 604 ms 216488 KB Output is correct
2 Correct 443 ms 231968 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24924 KB Output is correct
2 Correct 11 ms 25096 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 73664 KB Output is correct
2 Correct 128 ms 74440 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24924 KB Output is correct
2 Correct 13 ms 15980 KB Output is correct

Subtask #16
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 659 ms 216300 KB Output is correct
2 Correct 477 ms 216304 KB Output is correct