oj.uz

답안 #532144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532144 2022-03-02T07:35:01 Z abc864197532 Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 86 ms 10368 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l)
		cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif
 
int main () {
	owo;
	int n;
	cin >> n;
	vector <vector <int>> cnt(n, vector <int> (2, -1));
	lli ans = 0;
	for (int i = 0, x, y; i < n * 2; ++i) {
		cin >> x >> y, --x, --y;
		if (x < 0) {
			if (y <= 0)
				ans += -x - y, cnt[0][0]++;
			else
				ans += -x + y - 1, cnt[0][1]++;
		} else if (x >= n) {
			if (y <= 0)
				ans += x - n + 1 - y, cnt[n - 1][0]++;
			else
				ans += x - n + 1 + y - 1, cnt[n - 1][1]++;
		} else {
			if (y <= 0)
				ans += -y, cnt[x][0]++;
			else
				ans += y - 1, cnt[x][1]++;
 
		}
	}
	int now0 = 0, now1 = 0;
	for (int i = 0; i < n; ++i) {
		now0 += cnt[i][0], now1 += cnt[i][1];
		if (now0 < 0 && now1 > 0) {
			int mn = min(-now0, now1);
			now0 += mn, now1 -= mn, ans += mn;
		} else if (now0 > 0 && now1 < 0) {
			int mn = min(now0, -now1);
			now0 -= mn, now1 += mn, ans += mn;
		}
		ans += abs(now0) + abs(now1);
	}
	cout << ans << endl;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 0 ms 308 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 312 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 308 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 400 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 2 ms 396 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 2 ms 324 KB Output is correct
48 Correct 2 ms 328 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 400 KB Output is correct
55 Correct 1 ms 324 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 400 KB Output is correct
58 Correct 1 ms 324 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 396 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 0 ms 308 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 312 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 0 ms 308 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 2 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 400 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 2 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 2 ms 396 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 2 ms 324 KB Output is correct
48 Correct 2 ms 328 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 2 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 400 KB Output is correct
55 Correct 1 ms 324 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 400 KB Output is correct
58 Correct 1 ms 324 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 396 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 43 ms 7300 KB Output is correct
66 Correct 65 ms 10368 KB Output is correct
67 Correct 81 ms 8968 KB Output is correct
68 Correct 78 ms 8964 KB Output is correct
69 Correct 75 ms 8836 KB Output is correct
70 Correct 86 ms 8964 KB Output is correct
71 Correct 85 ms 8964 KB Output is correct
72 Correct 50 ms 8964 KB Output is correct
73 Correct 48 ms 8968 KB Output is correct
74 Correct 49 ms 8976 KB Output is correct
75 Correct 46 ms 8836 KB Output is correct
76 Correct 45 ms 8900 KB Output is correct
77 Correct 45 ms 8832 KB Output is correct
78 Correct 47 ms 8968 KB Output is correct
79 Correct 45 ms 8960 KB Output is correct
80 Correct 47 ms 8972 KB Output is correct
81 Correct 44 ms 8976 KB Output is correct
82 Correct 46 ms 8964 KB Output is correct
83 Correct 55 ms 8964 KB Output is correct
84 Correct 47 ms 8968 KB Output is correct
85 Correct 75 ms 8964 KB Output is correct
86 Correct 48 ms 8964 KB Output is correct
87 Correct 76 ms 8900 KB Output is correct
88 Correct 56 ms 8968 KB Output is correct
89 Correct 52 ms 8900 KB Output is correct
90 Correct 58 ms 8900 KB Output is correct
91 Correct 57 ms 8968 KB Output is correct
92 Correct 64 ms 8964 KB Output is correct
93 Correct 55 ms 9044 KB Output is correct
94 Correct 64 ms 8848 KB Output is correct
95 Correct 55 ms 8844 KB Output is correct
96 Correct 45 ms 8968 KB Output is correct
97 Correct 46 ms 8900 KB Output is correct
98 Correct 48 ms 8900 KB Output is correct
99 Correct 54 ms 8972 KB Output is correct
100 Correct 47 ms 8880 KB Output is correct
101 Correct 46 ms 8968 KB Output is correct
102 Correct 51 ms 8964 KB Output is correct
103 Correct 48 ms 8964 KB Output is correct