ZOJ 3938 Defuse the Bomb(模拟)

题意:

$模拟Defuse the Bomb这个游戏的说明书啦$

分析:

$写个函数来判断是位置还是值咯,代码量少,而且不会写错$

代码:

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
71
72
73
74
75
76
//
// Created by TaoSama on 2016-04-23
// Copyright (c) 2016 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define pr(x) cout << #x << " = " << x << " "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
//
void update(vector<pair<int, int> >& ans, int* a, bool position, int value) {
if(position) ans.push_back({value, a[value]});
else {
for(int i = 1; i <= 4; ++i)
if(a[i] == value) ans.push_back({i, a[i]});
}
}
int main() {
#ifdef LOCAL
freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
// freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
int t; scanf("%d", &t);
while(t--) {
vector<pair<int, int> > ans;
ans.push_back({0, 0}); //garbage value
for(int i = 1; i <= 5; ++i) {
int d, a[5]; scanf("%d", &d);
for(int j = 1; j <= 4; ++j) scanf("%d", a + j);
if(i == 1) {
if(d == 1) update(ans, a, 1, 2);
else update(ans, a, 1, d);
} else if(i == 2) {
if(d == 1) update(ans, a, 0, 4);
else if(d == 2 || d == 4)
update(ans, a, 1, ans[1].first);
else ans.push_back({1, a[1]});
} else if(i == 3) {
if(d == 1) update(ans, a, 0, ans[2].second);
else if(d == 2) update(ans, a, 0, ans[1].second);
else if(d == 3) update(ans, a, 1, 3);
else update(ans, a, 0, 4);
} else if(i == 4) {
if(d == 1) update(ans, a, 1, ans[1].first);
else if(d == 2) update(ans, a, 1, 1);
else update(ans, a, 1, ans[2].first);
} else {
if(d == 1) update(ans, a, 0, ans[1].second);
else if(d == 2) update(ans, a, 0, ans[2].second);
else if(d == 3) update(ans, a, 0, ans[4].second);
else update(ans, a, 0, ans[3].second);
}
}
for(int i = 1; i <= 5; ++i)
printf("%d %d\n", ans[i].first, ans[i].second);
}
return 0;
}


1. 除非注明,本博文即为原创,转载请注明链接地址
2. 本博文只代表博主当时的观点或结论,请不要恶意攻击
3. 如果本文帮到了您,不妨点一下 下面分享到 按钮,让更多的人看到