oj.uz

Submission #213232

# Submission time Handle Problem Language Result Execution time Memory
213232 2020-03-25T10:37:26 Z pavement Tower Defense (CEOI19_towerdefense) C++17
53 / 100
 7 ms 768 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define mt make_tuple

int xe, ye, xh, yh, c, d, dr[] = {-1, 0, 0, 1}, dc[] = {0, -1, 1, 0};
vector<pair<int, int> > hor, ver, mv;
set<pair<int, int> > s;

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> xe >> ye >> xh >> yh >> d;
	c = llabs(xe - xh) + llabs(ye - yh);
	if ((c > d || (c & 1) ^ (d & 1)) || (c == 1 && c ^ d)) return cout << "impossible\n", 0;
	if (yh > ye) {
		swap(xe, xh);
		swap(ye, yh);
	}
	if (llabs(xe - xh) == 1 && llabs(ye - yh) == 1) {
		if (d == 4) return cout << "impossible\n", 0;
		if (d == 2) {
			mv.emplace_back(min(xe, xh), ye);
			mv.emplace_back(xe, ye);
			mv.emplace_back(xh, yh);
		} else {
			d -= 6;
			int up = d >> 1, down = 2 + (d >> 1);
			for (int i = 0; i <= up; i++) mv.emplace_back(xe, ye + i);
			if (xe >= xh) {
				mv.emplace_back(xe, ye + up + 1);
				mv.emplace_back(xe - 1, ye + up + 1);
				mv.emplace_back(xe - 2, ye + up + 1);
				for (int i = 0; i <= down; i++) mv.emplace_back(xh - 1, yh + i);
			} else {
				mv.emplace_back(xe, ye + up + 1);
				mv.emplace_back(xe + 1, ye + up + 1);
				mv.emplace_back(xe + 2, ye + up + 1);
				for (int i = 0; i <= down; i++) mv.emplace_back(xh + 1, yh + i);
			}
		}
	} else if (xe == xh) {
		for (int i = xe; i < xe + (d - c >> 1); i++) mv.emplace_back(i, ye);
		for (int i = ye; i >= yh; i--) mv.emplace_back(xe + (d - c >> 1), i);
		for (int i = xe; i < xe + (d - c >> 1); i++) mv.emplace_back(i, yh);
	} else if (ye == yh) {
		if (xh > xe) swap(xe, xh);
		for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
		for (int i = xe; i >= xh; i--) mv.emplace_back(i, ye + (d - c >> 1));
		for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xh, i);
	} else if (abs(xe - xh) > 1) {
		if (xe >= xh) {
			for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
			for (int i = xe; i >= xh; i--) mv.emplace_back(i, ye + (d - c >> 1));
			for (int i = ye + (d - c >> 1) - 1; i >= yh; i--) mv.emplace_back(xh, i);
		} else {
			for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
			for (int i = xe; i <= xh; i++) mv.emplace_back(i, ye + (d - c >> 1));
			for (int i = ye + (d - c >> 1) - 1; i >= yh; i--) mv.emplace_back(xh, i);
		}
	} else {
		if (xe >= xh) {
			for (int i = 0; i < (d - c >> 1); i++) mv.emplace_back(xh - i, yh);
			for (int i = yh; i < ye; i++) mv.emplace_back(xh - (d - c >> 1), i);
			for (int i = xh - (d - c >> 1); i <= xe; i++) mv.emplace_back(i, ye);
		} else {
			for (int i = 0; i < (d - c >> 1); i++) mv.emplace_back(xh + i, yh);
			for (int i = yh; i < ye; i++) mv.emplace_back(xh + (d - c >> 1), i);
			for (int i = xh + (d - c >> 1); i >= xe; i--) mv.emplace_back(i, ye);
		}
	}
	sort(mv.begin(), mv.end());
	for (auto i : mv)
		for (int k = 0; k < 4; k++)
			if (!binary_search(mv.begin(), mv.end(), mp(i.first + dr[k], i.second + dc[k]))) s.emplace(i.first + dr[k], i.second + dc[k]);
	cout << s.size() << '\n';
	for (auto i : s) cout << i.first << ' ' << i.second << '\n';
}

Compilation message

towerdefense.cpp:11:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
towerdefense.cpp: In function 'int main()':
towerdefense.cpp:44:32: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   for (int i = xe; i < xe + (d - c >> 1); i++) mv.emplace_back(i, ye);
                              ~~^~~
towerdefense.cpp:45:58: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   for (int i = ye; i >= yh; i--) mv.emplace_back(xe + (d - c >> 1), i);
                                                        ~~^~~
towerdefense.cpp:46:32: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   for (int i = xe; i < xe + (d - c >> 1); i++) mv.emplace_back(i, yh);
                              ~~^~~
towerdefense.cpp:49:32: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
                              ~~^~~
towerdefense.cpp:50:61: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   for (int i = xe; i >= xh; i--) mv.emplace_back(i, ye + (d - c >> 1));
                                                           ~~^~~
towerdefense.cpp:51:32: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xh, i);
                              ~~^~~
towerdefense.cpp:54:33: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
                               ~~^~~
towerdefense.cpp:55:62: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = xe; i >= xh; i--) mv.emplace_back(i, ye + (d - c >> 1));
                                                            ~~^~~
towerdefense.cpp:56:25: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = ye + (d - c >> 1) - 1; i >= yh; i--) mv.emplace_back(xh, i);
                       ~~^~~
towerdefense.cpp:58:33: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = ye; i < ye + (d - c >> 1); i++) mv.emplace_back(xe, i);
                               ~~^~~
towerdefense.cpp:59:62: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = xe; i <= xh; i++) mv.emplace_back(i, ye + (d - c >> 1));
                                                            ~~^~~
towerdefense.cpp:60:25: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = ye + (d - c >> 1) - 1; i >= yh; i--) mv.emplace_back(xh, i);
                       ~~^~~
towerdefense.cpp:64:27: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = 0; i < (d - c >> 1); i++) mv.emplace_back(xh - i, yh);
                         ~~^~~
towerdefense.cpp:65:58: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = yh; i < ye; i++) mv.emplace_back(xh - (d - c >> 1), i);
                                                        ~~^~~
towerdefense.cpp:66:25: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = xh - (d - c >> 1); i <= xe; i++) mv.emplace_back(i, ye);
                       ~~^~~
towerdefense.cpp:68:27: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = 0; i < (d - c >> 1); i++) mv.emplace_back(xh + i, yh);
                         ~~^~~
towerdefense.cpp:69:58: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = yh; i < ye; i++) mv.emplace_back(xh + (d - c >> 1), i);
                                                        ~~^~~
towerdefense.cpp:70:25: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    for (int i = xh + (d - c >> 1); i >= xe; i--) mv.emplace_back(i, ye);
                       ~~^~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 7 ms 640 KB Output is correct

Subtask #2
28.0 / 28.0

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

Subtask #3
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 6 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 5 ms 384 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 5 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 5 ms 384 KB Output is correct
64 Correct 5 ms 384 KB Output is correct
65 Correct 5 ms 384 KB Output is correct
66 Correct 5 ms 384 KB Output is correct
67 Correct 5 ms 384 KB Output is correct
68 Correct 5 ms 384 KB Output is correct
69 Correct 5 ms 384 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 5 ms 384 KB Output is correct
73 Correct 5 ms 384 KB Output is correct
74 Correct 5 ms 384 KB Output is correct
75 Correct 5 ms 384 KB Output is correct
76 Correct 6 ms 640 KB Output is correct
77 Correct 5 ms 384 KB Output is correct
78 Correct 5 ms 384 KB Output is correct
79 Correct 6 ms 640 KB Output is correct
80 Correct 5 ms 384 KB Output is correct
81 Correct 5 ms 384 KB Output is correct
82 Correct 7 ms 768 KB Output is correct
83 Correct 5 ms 384 KB Output is correct
84 Correct 5 ms 384 KB Output is correct
85 Correct 6 ms 640 KB Output is correct
86 Correct 5 ms 384 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 5 ms 384 KB Output is correct
89 Correct 5 ms 384 KB Output is correct
90 Correct 5 ms 384 KB Output is correct
91 Correct 6 ms 640 KB Output is correct
92 Correct 5 ms 512 KB Output is correct
93 Correct 7 ms 768 KB Output is correct
94 Correct 5 ms 256 KB Output is correct
95 Correct 5 ms 384 KB Output is correct
96 Correct 6 ms 512 KB Output is correct
97 Correct 5 ms 384 KB Output is correct
98 Correct 5 ms 384 KB Output is correct
99 Correct 5 ms 384 KB Output is correct
100 Correct 5 ms 384 KB Output is correct
101 Correct 7 ms 768 KB Output is correct
102 Correct 5 ms 384 KB Output is correct
103 Correct 5 ms 384 KB Output is correct
104 Correct 6 ms 640 KB Output is correct
105 Correct 5 ms 384 KB Output is correct
106 Correct 5 ms 384 KB Output is correct
107 Correct 5 ms 384 KB Output is correct
108 Correct 5 ms 384 KB Output is correct
109 Correct 5 ms 384 KB Output is correct
110 Correct 5 ms 384 KB Output is correct
111 Correct 5 ms 384 KB Output is correct
112 Correct 5 ms 384 KB Output is correct
113 Correct 5 ms 384 KB Output is correct
114 Correct 5 ms 384 KB Output is correct
115 Correct 5 ms 384 KB Output is correct
116 Correct 5 ms 384 KB Output is correct
117 Correct 5 ms 384 KB Output is correct
118 Correct 5 ms 384 KB Output is correct
119 Correct 5 ms 384 KB Output is correct
120 Correct 5 ms 384 KB Output is correct
121 Correct 5 ms 384 KB Output is correct
122 Correct 5 ms 384 KB Output is correct
123 Correct 5 ms 384 KB Output is correct
124 Correct 5 ms 384 KB Output is correct
125 Correct 5 ms 384 KB Output is correct
126 Correct 5 ms 384 KB Output is correct
127 Correct 5 ms 384 KB Output is correct
128 Correct 5 ms 384 KB Output is correct
129 Correct 5 ms 384 KB Output is correct
130 Incorrect 5 ms 384 KB Turret placed on the entrance.
131 Halted 0 ms 0 KB -