답안 #821694

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
821694	2023-08-11T13:17:19 Z	PixelCat	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	49 ms	5844 KB

joi2019_ho_t4

/*     code by PixelCat     */
/*         meow owo         */

#include <bits/stdc++.h>
#define int LL  //__int128
#define double long double
using namespace std;
using LL = long long;
// using i128 = __int128_t;
using ull = unsigned long long;
using pii = pair<int, int>;

#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fors(i, a, b, s) for (int i = a; i <= b; i += s)
#define Forr(i, a, b) for (int i = a; i >= b; i--)
#define F first
#define S second

#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define mkp make_pair

#define MOD (int)(998244353)
// #define MOD (int)((LL)1'000'000'007)
#define EPS (1e-6)

namespace {

#ifdef NYAOWO
#include "./library/debug.hpp"
inline void USACO(const string &s) {
    cerr << "USACO: " << s << "\n";
}

#else
#define debug(...)
inline void timer() {}
inline void USACO(const string &s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

#endif

inline void NYA() {
    ios::sync_with_stdio(false);
    cin.tie(0);
}
inline int gcd(int a, int b) {
    return __gcd(a, b);
}
inline int lcm(int a, int b) {
    return a / gcd(a, b) * b;
}
inline int fpow(int b, int p, const int &mod = MOD) {
    if(p < 0) return fpow(fpow(b, -p, mod), mod - 2, mod);
    b %= mod;
    int ans = 1;
    for (; p; p >>= 1, b = b * b % mod)
        if (p & 1) ans = ans * b % mod;
    return ans;
}
template <typename T>
inline void chmin(T &_a, const T &_b) {
    if (_b < _a) _a = _b;
}
template <typename T>
inline void chmax(T &_a, const T &_b) {
    if (_a < _b) _a = _b;
}
mt19937_64 rng(
    chrono::steady_clock::now().time_since_epoch().count());

} // namespace

const int MAXN = 100'000;

int cnt[MAXN + 10][3];

int32_t main() {
    NYA();
    // nyaacho >/////<
    int n; cin >> n;
    int ans = 0;
    For(i, 1, n * 2) {
        int x, y; cin >> x >> y;
        if(x < 1) { ans += 1 - x; x = 1; }
        if(x > n) { ans += x - n; x = n; }
        if(y < 1) { ans += 1 - y; y = 1; }
        if(y > 2) { ans += y - 2; y = 2; }
        cnt[x][y]++;
    }
    int c1 = 0, c2 = 0;
    For(x, 1, n) {
        c1 += cnt[x][1] - 1;
        c2 += cnt[x][2] - 1;
        if(c1 > 0 && c2 < 0) {
            int k = min(c1, -c2);
            ans += k;
            c1 -= k; c2 += k;
        }
        if(c1 < 0 && c2 > 0) {
            int k = min(-c1, c2);
            ans += k;
            c1 += k; c2 -= k;
        }
        ans += abs(c1) + abs(c2);
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 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	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	328 KB	Output is correct
29	Correct	1 ms	216 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct

Subtask #2
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 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	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	328 KB	Output is correct
29	Correct	1 ms	216 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	388 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	360 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	380 KB	Output is correct
56	Correct	1 ms	344 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	1 ms	344 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	344 KB	Output is correct
63	Correct	1 ms	336 KB	Output is correct
64	Correct	1 ms	340 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	332 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 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	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	328 KB	Output is correct
29	Correct	1 ms	216 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	344 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	468 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	388 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	360 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	380 KB	Output is correct
56	Correct	1 ms	344 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	1 ms	344 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	344 KB	Output is correct
63	Correct	1 ms	336 KB	Output is correct
64	Correct	1 ms	340 KB	Output is correct
65	Correct	30 ms	4180 KB	Output is correct
66	Correct	34 ms	4900 KB	Output is correct
67	Correct	49 ms	5716 KB	Output is correct
68	Correct	30 ms	5836 KB	Output is correct
69	Correct	43 ms	5832 KB	Output is correct
70	Correct	38 ms	5836 KB	Output is correct
71	Correct	30 ms	5708 KB	Output is correct
72	Correct	39 ms	3512 KB	Output is correct
73	Correct	46 ms	3500 KB	Output is correct
74	Correct	28 ms	3512 KB	Output is correct
75	Correct	45 ms	3428 KB	Output is correct
76	Correct	29 ms	3532 KB	Output is correct
77	Correct	36 ms	3392 KB	Output is correct
78	Correct	29 ms	3512 KB	Output is correct
79	Correct	30 ms	3520 KB	Output is correct
80	Correct	29 ms	3532 KB	Output is correct
81	Correct	31 ms	3540 KB	Output is correct
82	Correct	32 ms	3540 KB	Output is correct
83	Correct	33 ms	3540 KB	Output is correct
84	Correct	35 ms	3880 KB	Output is correct
85	Correct	31 ms	3884 KB	Output is correct
86	Correct	39 ms	5400 KB	Output is correct
87	Correct	33 ms	5296 KB	Output is correct
88	Correct	39 ms	5840 KB	Output is correct
89	Correct	33 ms	5728 KB	Output is correct
90	Correct	38 ms	5724 KB	Output is correct
91	Correct	38 ms	5720 KB	Output is correct
92	Correct	32 ms	5840 KB	Output is correct
93	Correct	33 ms	5844 KB	Output is correct
94	Correct	32 ms	5840 KB	Output is correct
95	Correct	37 ms	5724 KB	Output is correct
96	Correct	34 ms	5108 KB	Output is correct
97	Correct	31 ms	5048 KB	Output is correct
98	Correct	35 ms	4876 KB	Output is correct
99	Correct	30 ms	4556 KB	Output is correct
100	Correct	29 ms	4620 KB	Output is correct
101	Correct	37 ms	4940 KB	Output is correct
102	Correct	30 ms	4644 KB	Output is correct
103	Correct	31 ms	4552 KB	Output is correct

답안 #821694

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 63.0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
63.0 / 63.0