oj.uz

Submission #851005

# Submission time Handle Problem Language Result Execution time Memory
851005 2023-09-18T07:41:31 Z green_gold_dog Coin Collecting (JOI19_ho_t4) C++17
8 / 100
 103 ms 8792 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n;
        cin >> n;
        vector<pair<ll, ll>> all;
        for (ll i = 1; i <= n; i++) {
                all.emplace_back(i, 1);
                all.emplace_back(i, 2);
        }
        n *= 2;
        vector<pair<ll, ll>> arr(n);
        for (ll i = 0; i < n; i++) {
                cin >> arr[i].first >> arr[i].second;
        }
        vector<ll> dp((1 << n), INF64);
        dp[0] = 0;
        for (ll i = 0; i < (1 << n); i++) {
                ll nc = 0;
                for (ll j = 0; j < n; j++) {
                        nc += (i >> j) & 1;
                }
                for (ll j = 0; j < n; j++) {
                        if (!((i >> j) & 1)) {
                                assign_min(dp[i | (1 << j)], dp[i] + abs(arr[j].first - all[nc].first) + abs(arr[j].second - all[nc].second));
                        }
                }
        }
        cout << dp.back() << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:81:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:82:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 97 ms 8540 KB Output is correct
5 Correct 96 ms 8536 KB Output is correct
6 Correct 99 ms 8540 KB Output is correct
7 Correct 102 ms 8540 KB Output is correct
8 Correct 96 ms 8540 KB Output is correct
9 Correct 99 ms 8540 KB Output is correct
10 Correct 96 ms 8540 KB Output is correct
11 Correct 97 ms 8540 KB Output is correct
12 Correct 98 ms 8656 KB Output is correct
13 Correct 94 ms 8540 KB Output is correct
14 Correct 100 ms 8540 KB Output is correct
15 Correct 97 ms 8536 KB Output is correct
16 Correct 97 ms 8536 KB Output is correct
17 Correct 101 ms 8540 KB Output is correct
18 Correct 99 ms 8540 KB Output is correct
19 Correct 95 ms 8540 KB Output is correct
20 Correct 101 ms 8540 KB Output is correct
21 Correct 95 ms 8540 KB Output is correct
22 Correct 95 ms 8536 KB Output is correct
23 Correct 96 ms 8536 KB Output is correct
24 Correct 96 ms 8792 KB Output is correct
25 Correct 103 ms 8792 KB Output is correct
26 Correct 93 ms 8536 KB Output is correct
27 Correct 96 ms 8664 KB Output is correct
28 Correct 100 ms 8540 KB Output is correct
29 Correct 96 ms 8476 KB Output is correct
30 Correct 97 ms 8540 KB Output is correct
31 Correct 96 ms 8536 KB Output is correct
32 Correct 98 ms 8536 KB Output is correct
33 Correct 95 ms 8620 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 97 ms 8540 KB Output is correct
5 Correct 96 ms 8536 KB Output is correct
6 Correct 99 ms 8540 KB Output is correct
7 Correct 102 ms 8540 KB Output is correct
8 Correct 96 ms 8540 KB Output is correct
9 Correct 99 ms 8540 KB Output is correct
10 Correct 96 ms 8540 KB Output is correct
11 Correct 97 ms 8540 KB Output is correct
12 Correct 98 ms 8656 KB Output is correct
13 Correct 94 ms 8540 KB Output is correct
14 Correct 100 ms 8540 KB Output is correct
15 Correct 97 ms 8536 KB Output is correct
16 Correct 97 ms 8536 KB Output is correct
17 Correct 101 ms 8540 KB Output is correct
18 Correct 99 ms 8540 KB Output is correct
19 Correct 95 ms 8540 KB Output is correct
20 Correct 101 ms 8540 KB Output is correct
21 Correct 95 ms 8540 KB Output is correct
22 Correct 95 ms 8536 KB Output is correct
23 Correct 96 ms 8536 KB Output is correct
24 Correct 96 ms 8792 KB Output is correct
25 Correct 103 ms 8792 KB Output is correct
26 Correct 93 ms 8536 KB Output is correct
27 Correct 96 ms 8664 KB Output is correct
28 Correct 100 ms 8540 KB Output is correct
29 Correct 96 ms 8476 KB Output is correct
30 Correct 97 ms 8540 KB Output is correct
31 Correct 96 ms 8536 KB Output is correct
32 Correct 98 ms 8536 KB Output is correct
33 Correct 95 ms 8620 KB Output is correct
34 Runtime error 2 ms 1880 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 97 ms 8540 KB Output is correct
5 Correct 96 ms 8536 KB Output is correct
6 Correct 99 ms 8540 KB Output is correct
7 Correct 102 ms 8540 KB Output is correct
8 Correct 96 ms 8540 KB Output is correct
9 Correct 99 ms 8540 KB Output is correct
10 Correct 96 ms 8540 KB Output is correct
11 Correct 97 ms 8540 KB Output is correct
12 Correct 98 ms 8656 KB Output is correct
13 Correct 94 ms 8540 KB Output is correct
14 Correct 100 ms 8540 KB Output is correct
15 Correct 97 ms 8536 KB Output is correct
16 Correct 97 ms 8536 KB Output is correct
17 Correct 101 ms 8540 KB Output is correct
18 Correct 99 ms 8540 KB Output is correct
19 Correct 95 ms 8540 KB Output is correct
20 Correct 101 ms 8540 KB Output is correct
21 Correct 95 ms 8540 KB Output is correct
22 Correct 95 ms 8536 KB Output is correct
23 Correct 96 ms 8536 KB Output is correct
24 Correct 96 ms 8792 KB Output is correct
25 Correct 103 ms 8792 KB Output is correct
26 Correct 93 ms 8536 KB Output is correct
27 Correct 96 ms 8664 KB Output is correct
28 Correct 100 ms 8540 KB Output is correct
29 Correct 96 ms 8476 KB Output is correct
30 Correct 97 ms 8540 KB Output is correct
31 Correct 96 ms 8536 KB Output is correct
32 Correct 98 ms 8536 KB Output is correct
33 Correct 95 ms 8620 KB Output is correct
34 Runtime error 2 ms 1880 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -