oj.uz

Submission #672721

# Submission time Handle Problem Language Result Execution time Memory
672721 2022-12-17T18:34:15 Z ghostwriter Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 53 ms 6540 KB 
// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const int N = 2e5 + 5;
int n;
pi a[N];
void input(int test_id) {
	cin >> n;
	FOR(i, 1, n << 1) cin >> a[i].st >> a[i].nd;
}
ll cost(const pi &a, const pi &b) { return 1LL * abs(a.st - b.st) + abs(a.nd - b.nd); }
namespace subtask12 {
    const ll oo = 1e18;
    const int N = 2005;
    ll d[N][N];
    void solve() {
        n <<= 1;
        sort(a + 1, a + 1 + n);
        FOS(i, n, 1)
        FOS(j, n >> 1, 0) {
            d[i][j] = oo;
            if (j < n / 2) d[i][j] = min(d[i][j], d[i + 1][j + 1] + cost(a[i], {j + 1, 1}));
            if (i - 1 - j < n / 2) d[i][j] = min(d[i][j], d[i + 1][j] + cost(a[i], {i - j, 2}));
        }
        cout << d[1][0];
    }
}
namespace subtask3 {
    /*
        Interesting problem :v. The main idea is to match every coin with a grid coordinate. We can transform every coin that lie outside the box
        to a coin that lie inside the box and create a new problem that is so much easier!

        I guess it isn't that easy >:(. Been thinking about this for almost a day, after transform every coin into the box, the next step is to think of
        a prefix sum algorithm (the very important idea). Suppose we have cnt1 coins is runing in row 1 (or spaces)
        and cnt2 coins is runing in row2 (or spaces), when we encounter
        a column i, if a coin meet a space, match it immediately (we can easily prove this with some cases). After that, if cnt1 and cnt2 have difference
        sign (we can match them from top to bottom), we match it immediately (and still, we can easily prove this with some other cases).
    */
    int d[N][3];
    void solve() {
        ll rs = 0;
        FOR(i, 1, n << 1) {
            if (a[i].st < 1) {
                rs += 1 - a[i].st;
                a[i].st = 1;
            }
            if (a[i].st > n) {
                rs += a[i].st - n;
                a[i].st = n;
            }
            if (a[i].nd < 1) {
                rs += 1 - a[i].nd;
                a[i].nd = 1;
            }
            if (a[i].nd > 2) {
                rs += a[i].nd - 2;
                a[i].nd = 2;
            }
            ++d[a[i].st][a[i].nd];
        }
        int cnt1 = 0, cnt2 = 0;
        FOR(i, 1, n) {
            cnt1 += d[i][1] - 1;
            cnt2 += d[i][2] - 1;
            WHILE(cnt1 < 0 && cnt2 > 0) {
                ++cnt1;
                --cnt2;
                ++rs;
            }
            WHILE(cnt1 > 0 && cnt2 < 0) {
                --cnt1;
                ++cnt2;
                ++rs;
            }
            rs += abs(cnt1) + abs(cnt2);
        }
        cout << rs;
    }
}
void solve(int test_id) {
    // if (n <= 1000) {
    //     subtask12::solve();
    //     return;
    // }
    subtask3::solve();
}
void reinit(int test_id) {

}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 23 ms 3568 KB Output is correct
66 Correct 53 ms 6540 KB Output is correct
67 Correct 42 ms 6172 KB Output is correct
68 Correct 37 ms 6220 KB Output is correct
69 Correct 37 ms 6244 KB Output is correct
70 Correct 38 ms 6136 KB Output is correct
71 Correct 39 ms 6184 KB Output is correct
72 Correct 37 ms 5068 KB Output is correct
73 Correct 37 ms 5012 KB Output is correct
74 Correct 41 ms 5068 KB Output is correct
75 Correct 41 ms 4940 KB Output is correct
76 Correct 37 ms 5080 KB Output is correct
77 Correct 37 ms 4940 KB Output is correct
78 Correct 38 ms 5104 KB Output is correct
79 Correct 39 ms 5140 KB Output is correct
80 Correct 39 ms 5088 KB Output is correct
81 Correct 40 ms 5112 KB Output is correct
82 Correct 39 ms 5092 KB Output is correct
83 Correct 45 ms 5072 KB Output is correct
84 Correct 38 ms 5400 KB Output is correct
85 Correct 39 ms 5324 KB Output is correct
86 Correct 40 ms 6232 KB Output is correct
87 Correct 38 ms 6140 KB Output is correct
88 Correct 37 ms 6132 KB Output is correct
89 Correct 39 ms 6256 KB Output is correct
90 Correct 39 ms 6220 KB Output is correct
91 Correct 38 ms 6128 KB Output is correct
92 Correct 35 ms 6272 KB Output is correct
93 Correct 36 ms 6220 KB Output is correct
94 Correct 41 ms 6132 KB Output is correct
95 Correct 39 ms 6136 KB Output is correct
96 Correct 38 ms 5864 KB Output is correct
97 Correct 35 ms 5800 KB Output is correct
98 Correct 36 ms 5708 KB Output is correct
99 Correct 36 ms 5596 KB Output is correct
100 Correct 37 ms 5656 KB Output is correct
101 Correct 38 ms 5724 KB Output is correct
102 Correct 38 ms 5616 KB Output is correct
103 Correct 39 ms 5520 KB Output is correct