oj.uz

답안 #121329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121329 2019-06-26T10:36:17 Z onjo0127 Coin Collecting (JOI19_ho_t4) C++11
100 / 100
 68 ms 1784 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1LL * 1e18;
int A[100009], B[100009];

inline int d(int a, int b, int c, int d) {
	return max(a - c, c - a) + max(b - d, d - b);
}

int main() {
	long long s = 0;
	int N; scanf("%d",&N);
	for(int i=0; i<2*N; i++) {
		int X, Y; scanf("%d%d",&X,&Y);
		if(Y <= 1) {
			if(Y == 1 && 1 <= X && X <= N) ++A[X];
			else if(X <= 1) ++A[1], s += d(1, 1, X, Y);
			else if(N <= X) ++A[N], s += d(N, 1, X, Y);
			else ++A[X], s += d(X, 1, X, Y);
		}
		else {
			if(Y == 2 && 1 <= X && X <= N) ++B[X];
			else if(X <= 1) ++B[1], s += d(1, 2, X, Y);
			else if(N <= X) ++B[N], s += d(N, 2, X, Y);
			else ++B[X], s += d(X, 2, X, Y);
		}
	}
	for(int i=1; i<=N; i++) --A[i], --B[i];
	for(int i=1; i<=N; i++) {
		if(A[i] >= 0 && B[i] >= 0) s += A[i] + B[i];
		else if(A[i] <= 0 && B[i] <= 0) s += - A[i] - B[i];
		else {
			int tmp = min(max(A[i], -A[i]), max(B[i], -B[i]));
			s += tmp;
			if(A[i] < 0) A[i] += tmp, B[i] -= tmp, s += - A[i] + B[i];
			else A[i] -= tmp, B[i] += tmp, s += A[i] - B[i];
		}
		A[i+1] += A[i];
		B[i+1] += B[i];
	}
	printf("%lld", s);
	return 0;
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int N; scanf("%d",&N);
         ~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:15:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int X, Y; scanf("%d%d",&X,&Y);
             ~~~~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 356 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Correct 3 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 3 ms 384 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 2 ms 384 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 2 ms 384 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 384 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 4 ms 384 KB Output is correct
52 Correct 2 ms 384 KB Output is correct
53 Correct 3 ms 384 KB Output is correct
54 Correct 2 ms 256 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 2 ms 384 KB Output is correct
57 Correct 3 ms 384 KB Output is correct
58 Correct 3 ms 384 KB Output is correct
59 Correct 3 ms 384 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 3 ms 384 KB Output is correct
64 Correct 2 ms 384 KB Output is correct
65 Correct 44 ms 1664 KB Output is correct
66 Correct 51 ms 1784 KB Output is correct
67 Correct 64 ms 1636 KB Output is correct
68 Correct 62 ms 1664 KB Output is correct
69 Correct 67 ms 1656 KB Output is correct
70 Correct 63 ms 1664 KB Output is correct
71 Correct 57 ms 1664 KB Output is correct
72 Correct 48 ms 1660 KB Output is correct
73 Correct 50 ms 1784 KB Output is correct
74 Correct 51 ms 1656 KB Output is correct
75 Correct 51 ms 1672 KB Output is correct
76 Correct 53 ms 1656 KB Output is correct
77 Correct 51 ms 1656 KB Output is correct
78 Correct 53 ms 1628 KB Output is correct
79 Correct 54 ms 1544 KB Output is correct
80 Correct 54 ms 1556 KB Output is correct
81 Correct 50 ms 1556 KB Output is correct
82 Correct 52 ms 1656 KB Output is correct
83 Correct 52 ms 1532 KB Output is correct
84 Correct 57 ms 1656 KB Output is correct
85 Correct 53 ms 1656 KB Output is correct
86 Correct 53 ms 1656 KB Output is correct
87 Correct 56 ms 1656 KB Output is correct
88 Correct 62 ms 1656 KB Output is correct
89 Correct 68 ms 1656 KB Output is correct
90 Correct 62 ms 1656 KB Output is correct
91 Correct 62 ms 1664 KB Output is correct
92 Correct 57 ms 1656 KB Output is correct
93 Correct 60 ms 1656 KB Output is correct
94 Correct 65 ms 1652 KB Output is correct
95 Correct 66 ms 1656 KB Output is correct
96 Correct 52 ms 1656 KB Output is correct
97 Correct 52 ms 1656 KB Output is correct
98 Correct 52 ms 1656 KB Output is correct
99 Correct 54 ms 1656 KB Output is correct
100 Correct 53 ms 1628 KB Output is correct
101 Correct 53 ms 1656 KB Output is correct
102 Correct 51 ms 1656 KB Output is correct
103 Correct 51 ms 1656 KB Output is correct