oj.uz

답안 #672641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
672641 2022-12-17T06:25:46 Z ghostwriter Coin Collecting (JOI19_ho_t4) C++17
37 / 100
 25 ms 24104 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 = 1e5 + 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];
    }
}
void solve(int test_id) {
    if (n <= 1000) {
        subtask12::solve();
        return;
    }
}
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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 420 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 420 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 20 ms 24024 KB Output is correct
35 Correct 18 ms 24068 KB Output is correct
36 Correct 18 ms 24020 KB Output is correct
37 Correct 19 ms 24052 KB Output is correct
38 Correct 20 ms 24020 KB Output is correct
39 Correct 23 ms 24020 KB Output is correct
40 Correct 19 ms 24064 KB Output is correct
41 Correct 19 ms 24040 KB Output is correct
42 Correct 19 ms 24020 KB Output is correct
43 Correct 18 ms 23944 KB Output is correct
44 Correct 18 ms 24036 KB Output is correct
45 Correct 19 ms 23984 KB Output is correct
46 Correct 19 ms 24044 KB Output is correct
47 Correct 19 ms 24044 KB Output is correct
48 Correct 20 ms 23960 KB Output is correct
49 Correct 18 ms 24052 KB Output is correct
50 Correct 25 ms 23988 KB Output is correct
51 Correct 20 ms 24052 KB Output is correct
52 Correct 18 ms 24020 KB Output is correct
53 Correct 19 ms 23928 KB Output is correct
54 Correct 24 ms 24104 KB Output is correct
55 Correct 18 ms 23988 KB Output is correct
56 Correct 20 ms 24012 KB Output is correct
57 Correct 19 ms 24000 KB Output is correct
58 Correct 20 ms 23992 KB Output is correct
59 Correct 22 ms 24020 KB Output is correct
60 Correct 21 ms 24020 KB Output is correct
61 Correct 19 ms 24048 KB Output is correct
62 Correct 18 ms 24012 KB Output is correct
63 Correct 19 ms 24000 KB Output is correct
64 Correct 19 ms 23964 KB Output is correct

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 420 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 20 ms 24024 KB Output is correct
35 Correct 18 ms 24068 KB Output is correct
36 Correct 18 ms 24020 KB Output is correct
37 Correct 19 ms 24052 KB Output is correct
38 Correct 20 ms 24020 KB Output is correct
39 Correct 23 ms 24020 KB Output is correct
40 Correct 19 ms 24064 KB Output is correct
41 Correct 19 ms 24040 KB Output is correct
42 Correct 19 ms 24020 KB Output is correct
43 Correct 18 ms 23944 KB Output is correct
44 Correct 18 ms 24036 KB Output is correct
45 Correct 19 ms 23984 KB Output is correct
46 Correct 19 ms 24044 KB Output is correct
47 Correct 19 ms 24044 KB Output is correct
48 Correct 20 ms 23960 KB Output is correct
49 Correct 18 ms 24052 KB Output is correct
50 Correct 25 ms 23988 KB Output is correct
51 Correct 20 ms 24052 KB Output is correct
52 Correct 18 ms 24020 KB Output is correct
53 Correct 19 ms 23928 KB Output is correct
54 Correct 24 ms 24104 KB Output is correct
55 Correct 18 ms 23988 KB Output is correct
56 Correct 20 ms 24012 KB Output is correct
57 Correct 19 ms 24000 KB Output is correct
58 Correct 20 ms 23992 KB Output is correct
59 Correct 22 ms 24020 KB Output is correct
60 Correct 21 ms 24020 KB Output is correct
61 Correct 19 ms 24048 KB Output is correct
62 Correct 18 ms 24012 KB Output is correct
63 Correct 19 ms 24000 KB Output is correct
64 Correct 19 ms 23964 KB Output is correct
65 Runtime error 17 ms 3024 KB Execution killed with signal 11
66 Halted 0 ms 0 KB -