oj.uz

Submission #928518

# Submission time Handle Problem Language Result Execution time Memory
928518 2024-02-16T14:21:46 Z guechotjrhh Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 131 ms 7252 KB 
#include<iostream>
#include<vector>
using namespace std;

long long arrangeCandles(int N, vector<int> X, vector<int> Y) {
	long long s = 0;
	vector<int> u1(N,0), d1(N,0);
	for (int i = 0; i < 2 * N; i++) {
		if (X[i] <= 1) { s += 1-X[i]; X[i] = 1; }
		if (X[i] >= N) { s += X[i]-N; X[i] = N; }

		if (Y[i] <= 1) { s += 1 - Y[i]; d1[X[i] - 1]++; }
		else { s += Y[i] - 2; u1[X[i] - 1]++; }
	}

    int u = 0, d = 0;
    for (int i = 0; i < N; i++) {
        int a = u1[i], b = d1[i];
        u += a - 1; d += b - 1;
        if (d < 0 && u>0) {
            if (abs(d) >= abs(u)) {
                d += u;
                s += u;
                u = 0;
            }
            else {
                u += d;
                s += abs(d);
                d = 0;
            }
        }
        else if (d > 0 && u < 0) {
            if (abs(d) >= abs(u)) {
                d += u;
                s += abs(u);
                u = 0;
            }
            else {
                u += d;
                s += d;
                d = 0;
            }
        }
        s += abs(d) + abs(u);
    }

	return s;
}

int main() {
	int N;
    cin >> N;
	vector<int> X(2 * N), Y(2 * N);
	for (int i = 0; i < 2 * N; i++) {
		cin >> X[i] >> Y[i];
	}

	long long ans = arrangeCandles(N, move(X), move(Y));
	cout << ans << endl;

	return 0;
}
/*
3
0 0
0 4
4 0
2 1
2 5
-1 1

*/

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 600 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 448 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 476 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 2 ms 348 KB Output is correct
50 Correct 1 ms 472 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 2 ms 348 KB Output is correct
54 Correct 1 ms 452 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 2 ms 480 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 67 ms 4284 KB Output is correct
66 Correct 131 ms 7252 KB Output is correct
67 Correct 107 ms 5960 KB Output is correct
68 Correct 98 ms 5948 KB Output is correct
69 Correct 101 ms 5956 KB Output is correct
70 Correct 101 ms 5836 KB Output is correct
71 Correct 100 ms 5952 KB Output is correct
72 Correct 103 ms 5972 KB Output is correct
73 Correct 101 ms 5884 KB Output is correct
74 Correct 100 ms 5944 KB Output is correct
75 Correct 99 ms 5820 KB Output is correct
76 Correct 107 ms 5952 KB Output is correct
77 Correct 98 ms 5716 KB Output is correct
78 Correct 105 ms 6224 KB Output is correct
79 Correct 101 ms 5968 KB Output is correct
80 Correct 102 ms 5972 KB Output is correct
81 Correct 103 ms 5944 KB Output is correct
82 Correct 101 ms 5712 KB Output is correct
83 Correct 99 ms 5968 KB Output is correct
84 Correct 99 ms 5968 KB Output is correct
85 Correct 101 ms 5716 KB Output is correct
86 Correct 100 ms 5712 KB Output is correct
87 Correct 101 ms 5960 KB Output is correct
88 Correct 99 ms 5716 KB Output is correct
89 Correct 100 ms 5832 KB Output is correct
90 Correct 97 ms 5960 KB Output is correct
91 Correct 100 ms 5944 KB Output is correct
92 Correct 100 ms 5968 KB Output is correct
93 Correct 102 ms 5828 KB Output is correct
94 Correct 95 ms 5824 KB Output is correct
95 Correct 99 ms 5832 KB Output is correct
96 Correct 101 ms 5968 KB Output is correct
97 Correct 99 ms 5952 KB Output is correct
98 Correct 100 ms 5948 KB Output is correct
99 Correct 99 ms 5944 KB Output is correct
100 Correct 99 ms 5816 KB Output is correct
101 Correct 99 ms 5828 KB Output is correct
102 Correct 100 ms 5812 KB Output is correct
103 Correct 101 ms 5948 KB Output is correct