oj.uz

Submission #260414

# Submission time Handle Problem Language Result Execution time Memory
260414 2020-08-10T08:39:27 Z stefantaga Tower Defense (CEOI19_towerdefense) C++14
100 / 100
 1 ms 416 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll sx,sy,ex,ey,i,i1,d,x1,y1,x2,y2,a,b;
    cin>>sx>>sy>>ex>>ey>>d;
    vector<pair<ll,ll> >v;
    if (sy>ey||(sy==ey&&sx>ex)){
        swap(sy,ey);
        swap(sx,ex);
    }
    d-=abs(sy-ey)+abs(sx-ex);
    if (d==0){
        cout<<"0\n";
        return 0;
    }
    else if (d<0){
        cout<<"impossible\n";
        return 0;
    }
    if (abs(sy-ey)+abs(sx-ex)<=1){
        cout<<"impossible\n";
        return 0;
    }
    if (sy+1==ey&&sx+1==ex){
        /*
        E. 
        .H
        */
        
        if (d<4||d%2==1){
            cout<<"impossible\n";
            return 0;
        }
        d-=4;
        x1=sx+1;
        y1=sy;
        v.push_back({x1,y1});
        x2=sx;
        y2=sy+1;
        v.push_back({x2,y2});
        d/=2;
        while (d--){
            y1--;
            x2--;
            v.push_back({x1,y1});
            v.push_back({x2,y2});
        }
    }
    else if (sy+1==ey&&sx-1==ex){
        /*
        .E 
        H.
        */
        if (d<4||d%2==1){
            cout<<"impossible\n";
            return 0;
        }
        d-=4;
        x1=sx-1;
        y1=sy;
        v.push_back({x1,y1});
        x2=sx;
        y2=sy+1;
        v.push_back({x2,y2});
        d/=2;
        while (d--){
            y1--;
            x2++;
            v.push_back({x1,y1});
            v.push_back({x2,y2});
        }
    }
    else if (sx==ex){//vertical line
        //Assume d>0 
        if (d<2||d%2==1){
            cout<<"impossible\n";
            return 0;
        }
        v.push_back({sx,sy+1});
        d-=2;
        x1=sx;
        y1=sy+1;
        x2=sx;
        y2=sy+1;
        d/=2;
        while (d--){
            x1++;
            x2--;
            v.push_back({x1,y1});
            v.push_back({x2,y2});
        }
    }
    else if (sy==ey){//horizontal line
        //Assume d>0 
        if (d<2||d%2==1){
            cout<<"impossible\n";
            return 0;
        }
        v.push_back({sx+1,sy});
        d-=2;
        x1=sx+1;
        y1=sy;
        x2=sx+1;
        y2=sy;
        d/=2;
        while (d--){
            y1++;
            y2--;
            v.push_back({x1,y1});
            v.push_back({x2,y2});
        }
    }
    else if (ex>sx){
        /*
        E.
        ..
        .H
        */
        d-=2;
        if (d<0||d%2==1){
            cout<<"impossible\n";
            return 0;
        }
        d/=2;
        v.push_back({sx+1,sy});
        v.push_back({sx,sy+1});
        x1=sx;
        y1=sy+1;
        x2=sx+1;
        y2=sy;
        if (d!=0){
            if (ex-sx==1){
                v.push_back({sx-1,sy+1});
                d--;
                x1=sx-1;
            }
            if (ey-sy==1){
                y2=sy-1;
                d--;
                v.push_back({sx+1,sy-1});
            }
        }
        while (d--){
                x1--;
                y2--;
                v.push_back({x1,y1});
                v.push_back({x2,y2});
        }
 
    }
    else if (sx>ex){
        /*
        .E
        ..
        H.
        */
        d-=2;
        if (d<0||d%2==1){
            cout<<"impossible\n";
            return 0;
        }
        d/=2;
        v.push_back({sx-1,sy});
        v.push_back({sx,sy+1});
        x1=sx;
        y1=sy+1;
        x2=sx-1;
        y2=sy;
        if (d!=0){
            if (sx-ex==1){
                v.push_back({sx+1,sy+1});
                x1=sx+1;
                d--;
            }
            if (ey-sy==1){
                y2=sy-1;
                d--;
                v.push_back({sx-1,sy-1});
            }
            
        }
        while (d--){
            x1++;
            y2--;
            v.push_back({x1,y1});
            v.push_back({x2,y2});
        }
        
 
    }
    else assert(false);
    
    
    cout<<v.size()<<'\n';
    for (i=0;i<v.size();i++){
        cout<<v[i].first<<' '<<v[i].second<<'\n';
    }
}

Compilation message

towerdefense.cpp: In function 'int main()':
towerdefense.cpp:198:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<v.size();i++){
              ~^~~~~~~~~
towerdefense.cpp:7:22: warning: unused variable 'i1' [-Wunused-variable]
     ll sx,sy,ex,ey,i,i1,d,x1,y1,x2,y2,a,b;
                      ^~
towerdefense.cpp:7:39: warning: unused variable 'a' [-Wunused-variable]
     ll sx,sy,ex,ey,i,i1,d,x1,y1,x2,y2,a,b;
                                       ^
towerdefense.cpp:7:41: warning: unused variable 'b' [-Wunused-variable]
     ll sx,sy,ex,ey,i,i1,d,x1,y1,x2,y2,a,b;
                                         ^

Subtask #1
25.0 / 25.0

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

Subtask #2
28.0 / 28.0

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

Subtask #3
47.0 / 47.0

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