oj.uz

답안 #212920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212920 2020-03-24T14:20:38 Z Blerargh Tower Defense (CEOI19_towerdefense) C++17
53 / 100
 5 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef pair<ld,ld> id;

#define FOR(i, a, b) for(int i=(a); i<=(b); i++)
#define ROF(i, a, b) for(int i=(a); i>=(b); i--)
#define MEM(x, v) memset(x, v, sizeof(x))
#define FILL(x, n, v) fill(x, x+n, v);
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort((x).begin(), (x).end())
#define CMPSORT(x, cp) sort((x).begin(), (x).end(), cp)
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

#define f first
#define s second
#define ins insert
#define e emplace
#define eb emplace_back
#define ef emplace_front
#define p push
#define pf push_front
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ft front
#define bk back
#define pp pop
#define ppb pop_back
#define ppf pop_front

#define db cout<<"YEET\n";
#define ct(x) cout<<x<<'\n';

const ll MOD = 1e9+7; //998244353
const ll MAXN = 2e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);

int main(){
    FAST
    ll sx, sy, ex, ey;
    cin >> sx >> sy >> ex >> ey;
    ll d;
    cin >> d;
    ll dist = abs(ey-sy) + abs(ex-sx);

    bool left;
    if (sx <= ex) left=1;
    else left=0;

    vector<ii> ans;

    if (dist > d || (d-dist)&1 || (dist==1 && d!=1)){
        cout << "impossible";
        return 0;
    } else if (abs(ex-sx)==1 && abs(ey-sy)==1) {
        if (d<=5 && d>=3){
            cout << "impossible";
            return 0;
        }
    } else if (abs(ey-sy)<=1){
        ll border = (d-dist)/2 - 1;

        if (border!=-1){
            if (left){
                ans.eb(sx+1,sy);
                FOR(i,1,border){
                    ans.eb(sx+1,sy+i);
                    ans.eb(sx+1,sy-i);
                }
                if (abs(ey-sy)==1) {
                    ans.eb(sx+1,sy+border+1);
                    ans.eb(sx+1,sy-border-1);
                }
            } else {
                ans.eb(sx-1,sy);
                FOR(i,1,border){
                    ans.eb(sx-1,sy+i);
                    ans.eb(sx-1,sy-i);
                }
                if (abs(ey-sy)==1) {
                    ans.eb(sx-1,sy+border+1);
                    ans.eb(sx-1,sy-border-1);
                }
            }
        }
    } else {
        ll backtrack = (d-dist)/2;

        if (left){
            ans.eb(sx+1,sy-1);
            ans.eb(sx+1,sy);
            ans.eb(sx+1,sy+1);

            FOR(i,1,backtrack){
                ans.eb(sx-i+1, sy+1);
                ans.eb(sx-i+1, sy-1);
            }
        } else {
            ans.eb(sx-1,sy-1);
            ans.eb(sx-1,sy);
            ans.eb(sx-1,sy+1);

            FOR(i,1,backtrack){
                ans.eb(sx+i-1, sy+1);
                ans.eb(sx+i-1, sy-1);
            }
        }
    }

    cout << ans.size() << '\n';
    for (auto i : ans){
        cout << i.f << " " << i.s << '\n';
    }
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 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 4 ms 384 KB Output is correct
15 Correct 4 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 4 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct

Subtask #3
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 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 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 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 4 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 4 ms 384 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 4 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 4 ms 384 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 4 ms 384 KB Output is correct
43 Correct 4 ms 384 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 4 ms 384 KB Output is correct
46 Correct 5 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 384 KB Output is correct
49 Correct 4 ms 384 KB Output is correct
50 Correct 4 ms 384 KB Output is correct
51 Correct 4 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 4 ms 384 KB Output is correct
56 Correct 4 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 4 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 4 ms 384 KB Output is correct
64 Correct 4 ms 384 KB Output is correct
65 Correct 5 ms 384 KB Output is correct
66 Correct 4 ms 384 KB Output is correct
67 Correct 4 ms 384 KB Output is correct
68 Correct 4 ms 384 KB Output is correct
69 Correct 5 ms 384 KB Output is correct
70 Correct 4 ms 384 KB Output is correct
71 Correct 4 ms 384 KB Output is correct
72 Correct 4 ms 384 KB Output is correct
73 Correct 4 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 4 ms 384 KB Output is correct
77 Correct 5 ms 384 KB Output is correct
78 Correct 4 ms 384 KB Output is correct
79 Correct 5 ms 384 KB Output is correct
80 Correct 5 ms 384 KB Output is correct
81 Correct 5 ms 384 KB Output is correct
82 Correct 5 ms 384 KB Output is correct
83 Correct 5 ms 384 KB Output is correct
84 Correct 4 ms 384 KB Output is correct
85 Correct 5 ms 384 KB Output is correct
86 Correct 5 ms 384 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 4 ms 384 KB Output is correct
89 Correct 5 ms 384 KB Output is correct
90 Correct 4 ms 384 KB Output is correct
91 Correct 5 ms 384 KB Output is correct
92 Correct 5 ms 384 KB Output is correct
93 Correct 5 ms 384 KB Output is correct
94 Correct 5 ms 384 KB Output is correct
95 Correct 5 ms 384 KB Output is correct
96 Correct 4 ms 384 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 5 ms 384 KB Output is correct
102 Correct 5 ms 384 KB Output is correct
103 Correct 4 ms 384 KB Output is correct
104 Correct 5 ms 512 KB Output is correct
105 Correct 5 ms 384 KB Output is correct
106 Correct 4 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 4 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 4 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 4 ms 384 KB Output is correct
121 Correct 4 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 4 ms 384 KB Output is correct
125 Correct 5 ms 384 KB Output is correct
126 Correct 4 ms 384 KB Output is correct
127 Correct 4 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 Distance from entrance to home is not d.
131 Halted 0 ms 0 KB -