oj.uz

Submission #212917

# Submission time Handle Problem Language Result Execution time Memory
212917 2020-03-24T14:11:58 Z Blerargh Tower Defense (CEOI19_towerdefense) C++17
25 / 100
 6 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(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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 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

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 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 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 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 5 ms 384 KB Output is correct
11 Correct 4 ms 512 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 5 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 6 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 4 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 4 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Incorrect 6 ms 384 KB Expected but did not find "impossible".
30 Halted 0 ms 0 KB -

Subtask #3
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 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 256 KB Output is correct
9 Correct 4 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 4 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 5 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 512 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 5 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 4 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 6 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 4 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 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 Incorrect 6 ms 384 KB Expected but did not find "impossible".
37 Halted 0 ms 0 KB -