50001. Vehicle
難度: 2/51
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
static inline int max(int a, int b){
if(a > b) return a;
else return b;
}
static inline int this_abs(int n){
if(n < 0) return -n;
else return n;
}
int a, b, c, d, e;
int p, q, r, s;
int x, y, fuel;
int ans_gold = 0;
static inline void ipt(){
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
scanf("%d %d %d %d", &p, &q, &r, &s);
scanf("%d %d %d", &x, &y, &fuel);
}
int get_dir(){
return this_abs(a * x + b * y) % 4;
}
int get_gold(){
return this_abs(c * x + d * y) % e;
}
int main(){
ipt();
ans_gold += get_gold();
while(fuel != 0){
int dir = get_dir();
// update dir
if(dir == 0) y++;
else if(dir == 1) x++;
else if(dir == 2) y--;
else x--;
// either get gold or get teleported
if(x == p && y == q){
x = r; y = s;
}
else if(x == r && y == s){
x = p; y = q;
}
else{
ans_gold += get_gold();
}
fuel--;
}
printf("%d\n", ans_gold);
printf("%d %d\n", x, y);
}