| Task: | Time bomb |
| Sender: | Pietari Kaskela |
| Submission time: | 2016-09-20 18:06:47 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.05 s | details |
| #2 | ACCEPTED | 0.06 s | details |
| #3 | ACCEPTED | 0.05 s | details |
| #4 | ACCEPTED | 0.06 s | details |
| #5 | ACCEPTED | 0.05 s | details |
| #6 | ACCEPTED | 0.05 s | details |
| #7 | ACCEPTED | 0.05 s | details |
| #8 | ACCEPTED | 0.06 s | details |
| #9 | ACCEPTED | 0.05 s | details |
| #10 | ACCEPTED | 0.05 s | details |
| #11 | ACCEPTED | 0.05 s | details |
| #12 | ACCEPTED | 0.06 s | details |
| #13 | ACCEPTED | 0.05 s | details |
| #14 | ACCEPTED | 0.05 s | details |
| #15 | ACCEPTED | 0.05 s | details |
| #16 | ACCEPTED | 0.08 s | details |
| #17 | ACCEPTED | 0.05 s | details |
| #18 | ACCEPTED | 0.06 s | details |
| #19 | ACCEPTED | 0.06 s | details |
| #20 | ACCEPTED | 0.05 s | details |
Code
#include <bits/stdc++.h>
#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ld long double
#define defmod 1000000007
#define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0));
using namespace std;
string c[10][5] = {{"###",
"#.#",
"#.#",
"#.#",
"###"},
{ "..#",
"..#",
"..#",
"..#",
"..#"},
{ "###",
"..#",
"###",
"#..",
"###"},
{ "###",
"..#",
"###",
"..#",
"###"},
{ "#.#",
"#.#",
"###",
"..#",
"..#"},
{ "###",
"#..",
"###",
"..#",
"###"},
{ "###",
"#..",
"###",
"#.#",
"###"},
{ "###",
"..#",
"..#",
"..#",
"..#"},
{ "###",
"#.#",
"###",
"#.#",
"###"},
{ "###",
"#.#",
"###",
"..#",
"###"}};
string t[5];
int match(int j){
for(int luku = 0; luku < 10; luku++){
bool ok = true;
for(int i = 0; i < 5; ++i){
for(int jj = 0; jj < 3; ++jj){
if(t[i][j+jj] != c[luku][i][jj])
ok = false;
}
}
if(ok)
return luku;
}
return 42;
}
int main(){
cin.sync_with_stdio(0);
cin.tie(0);
int n = 5;
for(int i = 0; i < n; ++i)
cin >> t[i];
int m = t[0].length();
i64 lol = 0;
i64 k = 1;
for(int j = m-3; j >= 0; j-=4){
lol+=k*match(j);
k*=10;
}
if(lol%97 == 0)
cout << "BEER!!" << endl;
else
cout << "BOOM!" << endl;
return 0;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| ###.###...# ..#.#.#...# ###.###...# #.....#...# ###.###...# |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 2
Verdict: ACCEPTED
| input |
|---|
| ###.#.#.### #...#.#...# ###.###.### ..#...#...# ###...#.### |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 3
Verdict: ACCEPTED
| input |
|---|
| ###.###.###.###.###.#.#.### #.#.#.....#.#.#...#.#.#.#.# ###.###...#.#.#.###.###.### #.#.#.#...#.#.#.#.....#.#.# ###.###...#.###.###...#.### |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 4
Verdict: ACCEPTED
| input |
|---|
| ###.#.#.###.###.###.###.###.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 5
Verdict: ACCEPTED
| input |
|---|
| ###.###.###.###.#.#.###.### #.#.#.#.#.#.#.#.#.#.#...#.. ###.###.###.###.###.###.### #.#...#...#...#...#.#.#.#.# ###.###.###.###...#.###.### |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 6
Verdict: ACCEPTED
| input |
|---|
| ###...#.#.#.###.###.###.###...... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 7
Verdict: ACCEPTED
| input |
|---|
| #.#.###.###.###.###...#.### #.#.#.....#.#...#.#...#.#.# ###.###.###.###.#.#...#.### ..#.#.#...#.#.#.#.#...#.#.# ..#.###.###.###.###...#.### |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 8
Verdict: ACCEPTED
| input |
|---|
| #.#.###.#.#.###.###.###.###.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 9
Verdict: ACCEPTED
| input |
|---|
| ###.###.###.###.###.###.### #.#...#.#.#...#.#.....#.#.# ###.###.###.###.###.###.### #.#.#...#.#.#.....#...#...# ###.###.###.###.###.###.### |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 10
Verdict: ACCEPTED
| input |
|---|
| ###.#.#.###.###.###.###.#.#.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 11
Verdict: ACCEPTED
| input |
|---|
| ..#.###...#.###.###.###.### ..#.#.....#.#...#.#.#...#.# ..#.###...#.###.#.#.###.#.# ..#.#.#...#...#.#.#...#.#.# ..#.###...#.###.###.###.### |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 12
Verdict: ACCEPTED
| input |
|---|
| ..#.###.###.###.#.#...#.#.#.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 13
Verdict: ACCEPTED
| input |
|---|
| ###.###.###.###...#...# ..#...#.#.#...#...#...# ###.###.###.###...#...# #...#.....#.#.....#...# ###.###.###.###...#...# |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 14
Verdict: ACCEPTED
| input |
|---|
| ###.###.###.#.#.###.###.###.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 15
Verdict: ACCEPTED
| input |
|---|
| ###.###.###.###.###.###.### #...#...#.....#.#.#...#...# ###.###.###.###.#.#.###...# #.#.#.#.#.#...#.#.#.#.....# ###.###.###.###.###.###...# |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 16
Verdict: ACCEPTED
| input |
|---|
| ..#.###.###.###.###.###.###.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 17
Verdict: ACCEPTED
| input |
|---|
| ###.#.#.###.###...#.###.### #.#.#.#.#.#...#...#.#.#.#.# ###.###.###.###...#.#.#.### ..#...#.#.#...#...#.#.#.#.# ###...#.###.###...#.###.### |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 18
Verdict: ACCEPTED
| input |
|---|
| ###.###.###.###...#.###.###.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
Test 19
Verdict: ACCEPTED
| input |
|---|
| ###.###...#.###.#.#.###.### ..#.#.#...#...#.#.#...#...# ..#.###...#.###.###...#...# ..#.#.#...#.#.....#...#...# ..#.###...#.###...#...#...# |
| correct output |
|---|
| BEER!! |
| user output |
|---|
| BEER!! |
Test 20
Verdict: ACCEPTED
| input |
|---|
| ###.#.#.###.###.###.###.#.#.##... |
| correct output |
|---|
| BOOM! |
| user output |
|---|
| BOOM! |
