oj.uz

Submission #828758

# Submission time Handle Problem Language Result Execution time Memory
828758 2023-08-17T15:20:03 Z dijbkr Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 42 ms 1496 KB 
//const int NUMBEROFNODES = ...;
//struct Trie{
//    struct Node{
//        int child[26];
//        int exist, cnt;
//    } nodes[NUMBEROFNODES];
//
//    int cur; // Hiện trong trie đang có bao nhiêu đỉnh
//    Trie() : cur(0) { // Tạo nút gốc cho Trie là đỉnh 0 khi khởi tạo Trie
//        memset(nodes[0].child, -1, sizeof(nodes[cur].child));
//        nodes[0].exist = nodes[0].cnt = 0;
//    };
//
//    int new_node() { // Tạo và trả về giá trị của đỉnh mới được tạo ra
//        cur++;
//        memset(nodes[cur].child, -1, sizeof(nodes[cur].child));
//        nodes[cur].exist = nodes[cur].cnt = 0;
//        return cur;
//    }
//
//    void add_string(string s) {
//        int pos = 0;
//        for (auto f : s) {
//            int c = f - 'a';
//            if (nodes[pos].child[c] == -1) { // Nếu cạnh tương ứng chữ cái c
//                                             // chưa tồn tại thì ta tạo ra đỉnh mới
//                nodes[pos].child[c] = new_node();
//            }
//            pos = nodes[pos].child[c];
//            nodes[pos].cnt++; // Có thêm một xâu trong trie có tiền tố
//                              // là xâu được thể hiện bằng đỉnh hiện tại
//        }
//        nodes[pos].exist++; // Đã tìm được đỉnh tương ứng với xâu s,
//                            // ta tăng biến exist của đỉnh lên 1
//    }
//
//    bool delete_string_recursive(int pos, string& s, int i) { // Trả về liệu đỉnh pos
//                                                              // có bị xóa đi hay không
//        if (i != (int)s.size()) { // Nếu chưa đến đỉnh tương ứng với xâu s
//                                  // thì tiếp tục đệ quy xuống dưới
//            int c = s[i] - 'a';
//            bool isChildDeleted = delete_string_recursive(nodes[pos].child[c], s, i + 1);
//            if (isChildDeleted) nodes[pos].child[c] = -1; // Nếu đỉnh con tương ứng bị xóa thì
//                                                          // ta gán lại đỉnh tương ứng bằng -1
//        }
//        else nodes[pos].exist--; // Nếu đã đến đỉnh tương ứng với xâu s
//                                 // thì ta giảm biến exist của đỉnh đi 1
//
//        if (pos != 0) { // Nếu đỉnh đang xét không phải gốc thì ta giảm biến cnt của đỉnh đi 1
//                        // và kiểm tra đỉnh có bị xóa đi hay không
//                        // Đỉnh bị xóa nếu không còn xâu nào đi qua nó, nói cách khác là
//                        // không còn xâu nào có tiền tố là xâu được thể hiện bởi đỉnh pos
//            nodes[pos].cnt--;
//            if (nodes[pos].cnt == 0) return true;
//        }
//        return false;
//    }
//
//    void delete_string(string s) {
//        if (find_string(s) == false) return; // Kiểm tra xâu s có trong
//                                             // trie hay không
//        delete_string_recursive(0, s, 0); // Gọi hàm đệ quy xóa xâu s khỏi trie
//    }
//
//    bool find_string(string s) {
//        int pos = 0;
//        for (auto f : s) {
//            int c = f - 'a';
//            if (nodes[pos].child[c] == -1) return false;
//            pos = nodes[pos].child[c];
//        }
//        return (nodes[pos].exist != 0); // Kiểm tra có xâu nào
//                                        // kết thúc tại đỉnh này hay không
//    }
//};

#include <bits/stdc++.h>
using namespace std;

const int N = 100003;
int n, x, y, i;
int m[N][3], a, b;
long long ans;

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin >> n;
	for(i=1; i<=(n<<1); ++i){
		cin >> x >> y;
		if(x < 1) ans += 1 - x, x = 1;
		else if(x > n) ans += x - n, x = n;
		if(y < 1) ans += 1 - y, y = 1;
		else if(y > 2) ans += y - 2, y = 2;
		++m[x][y];
	}
	for(i=1; i<=n; ++i){
		a += m[i][1] - 1, b +=  m[i][2] - 1;
		while(a > 0 and b < 0) --a, ++b, ++ans;
		while(a < 0 and b > 0) ++a, --b, ++ans;
		ans += abs(a) + abs(b);
	}
	cout << ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 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 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 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 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 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 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 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 212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 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 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 300 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 260 KB Output is correct
64 Correct 1 ms 340 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 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 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 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 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 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 212 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 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 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 300 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 260 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 26 ms 1492 KB Output is correct
66 Correct 33 ms 312 KB Output is correct
67 Correct 28 ms 1364 KB Output is correct
68 Correct 29 ms 1364 KB Output is correct
69 Correct 29 ms 1492 KB Output is correct
70 Correct 42 ms 1488 KB Output is correct
71 Correct 33 ms 1492 KB Output is correct
72 Correct 28 ms 336 KB Output is correct
73 Correct 28 ms 212 KB Output is correct
74 Correct 28 ms 340 KB Output is correct
75 Correct 29 ms 212 KB Output is correct
76 Correct 28 ms 320 KB Output is correct
77 Correct 28 ms 336 KB Output is correct
78 Correct 28 ms 340 KB Output is correct
79 Correct 27 ms 340 KB Output is correct
80 Correct 28 ms 340 KB Output is correct
81 Correct 31 ms 340 KB Output is correct
82 Correct 28 ms 360 KB Output is correct
83 Correct 29 ms 344 KB Output is correct
84 Correct 28 ms 596 KB Output is correct
85 Correct 28 ms 596 KB Output is correct
86 Correct 28 ms 1364 KB Output is correct
87 Correct 28 ms 1436 KB Output is correct
88 Correct 29 ms 1492 KB Output is correct
89 Correct 29 ms 1496 KB Output is correct
90 Correct 29 ms 1492 KB Output is correct
91 Correct 29 ms 1492 KB Output is correct
92 Correct 36 ms 1472 KB Output is correct
93 Correct 28 ms 1492 KB Output is correct
94 Correct 28 ms 1492 KB Output is correct
95 Correct 28 ms 1496 KB Output is correct
96 Correct 28 ms 1108 KB Output is correct
97 Correct 28 ms 1084 KB Output is correct
98 Correct 31 ms 992 KB Output is correct
99 Correct 28 ms 852 KB Output is correct
100 Correct 28 ms 884 KB Output is correct
101 Correct 35 ms 1032 KB Output is correct
102 Correct 28 ms 916 KB Output is correct
103 Correct 28 ms 724 KB Output is correct