CSP 2018-12-2 小明放学

1
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
64
65
66
67
68
69
70
#include <iostream>

using namespace std;

long long res = 0,t;
int r, y, g, n, k;
int time = 0;
int ahead = 0;
int main()
{
cin >> r >> y >> g;
cin >> n;
while (n)
{
cin >> k >> t;
time = r + g + y;
ahead = res % time;
if (k==0)
{
res += t;
}
else if (k == 1) {
if (ahead < t) {
res += t - ahead;
}
else if (ahead >= t && (ahead < t + g)) {
;
}
else if (ahead >= t + g && ahead < t + g + y) {
res += t + g + y - ahead + r;
}
else if (ahead >= t + g + y && ahead < r + g + y) {
res += r + g + y + t - ahead;
}
}
else if (k == 2) {
if (ahead < t) {
res += t - ahead + r;
}
else if (ahead >= t && ahead < t + r) {
res += t + r - ahead;
}
else if (ahead >= t + r && ahead < t + r + g) {
;
}
else if (ahead >= t + r + g && ahead < r + g + y) {
res += r + g + y + t - ahead + r;
}
}
else if(k==3)
{
if (ahead < t) {
;
}
else if (ahead >= t && ahead < t + y) {
res += t + y - ahead + r;
}
else if (ahead >= t + y && ahead < t + r + y) {
res += t + r + y - ahead;
}
else if (ahead >= t + r + y && ahead < r + g + y) {
;
}
}
n--;
}
cout << res;
return 0;

}

CSP 2019-3-2 二十四点 CSP 2019-3-1 小中大

Kommentare

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×