Submission #267230

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
267230	2020-08-16T01:53:30 Z	taulant	Tower Defense (CEOI19_towerdefense)	C++14	100 / 100	5 ms	416 KB

towerdefense

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

int32_t main(){
    int x0, y0, x1, y1, d; cin >> x0 >> y0 >> x1 >> y1 >> d;
    if(x0 > x1){
        swap(x0, x1);
        swap(y0, y1);
    }
    int d1 = abs(y1-y0) + x1-x0;
    if((d1 > d) || ((d1^d) & 1) || (d1 == 1 && d > 1) || ((x1-x0) == 1 && abs(y1-y0) == 1 && d == 4)){
        cout << "impossible" << endl;
        exit(0);
    }
    if(d == d1){
        cout << 0 << endl;
        exit(0);
    }
    //a solution exists, start has lower x
    //cases: diff x >= 2, vertical line of turrets
    //diff y >= 2
    //x0+1, y0+-1
    if(x1 > x0+1){
        if(y1 < y0) swap(y0, y1);
        int l = (d-d1-2)/2;
        cout << y1-y0+1+l+l << endl;
        for(int i=y0-l; i <= y1+l; ++i) cout << x0+1 << " " << i << endl;
    }
    else if(abs(y1-y0) > 1){
        int l = (d-d1-2)/2;
        cout << 2*(x1-x0+1+l+l) << endl;
        for(int i=x0-l; i <= x1+l; ++i) cout << i << " " << y0+1 << endl;
        for(int i=x0-l; i <= x1+l; ++i) cout << i << " " << y0-1 << endl;
    }
    else if(y1 > y0){ //{x1, y1} = {x0+1, y0+1}
        int l = (d - 4)/2;
        cout << d-4 << endl;
        for(int i=1; i<=l; ++i) cout << x0+i << " " << y0 << endl << x0 << " " << y0+i << endl;
    }
    else { //{x1, y1} = {x0+1, y0-1}
        int l = (d - 4)/2;
        cout << d-4 << endl;
        for(int i=1; i<=l; ++i) cout << x0+i << " " << y0 << endl << x0 << " " << y0-i << endl;
    }
}

Subtask #1
25.0 / 25.0

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

Subtask #2
28.0 / 28.0

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

Subtask #3
47.0 / 47.0

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

Submission #267230

Compilation message

Subtask #1 25.0 / 25.0

Subtask #2 28.0 / 28.0

Subtask #3 47.0 / 47.0

Subtask #1
25.0 / 25.0

Subtask #2
28.0 / 28.0

Subtask #3
47.0 / 47.0