Uva/Uva11975.cpp at master · Dobromi/Uva · GitHub

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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <sstream>
#include <set>
#include <string.h>
using namespace std;


int main()
{
    int Tc;
    scanf("%d",&Tc);
    int cas=1;
    while(Tc--){
        int numberOfBalls;
        int numberOfTickets;
        scanf("%d %d",&numberOfBalls,&numberOfTickets);
        vector<int> balls;
        for(int i=0;i<numberOfBalls;i++){
            int n;
            cin>>n;balls.push_back(n);
        }
        vector<int> values;
        for(int i=0;i<4;i++){
            int n;
            cin>>n;values.push_back(n);
        }
        vector<int> sums;
        for(int i=0;i<numberOfTickets;i++){

            int nums[5][5];
            for(int i=0;i<5;i++){
                for(int j=0;j<5;j++){
                    int n;
                    cin>>n;nums[i][j]=n;
                }
            }
            int sum=0;
            vector<pair<int,int>> diagonals={{0,0},{0,4},{4,0},{4,4}};
            //Check Diagonals
            int counter=0;
            bool diagonal=true;
            for(int i=0;i<diagonals.size();i++){
                pair<int,int> val=diagonals[i];
                bool mark=false;
                for(int k=0;k<numberOfBalls;k++){
                    counter++;
                    if(nums[val.first][val.second]==balls[k]){
                        mark=true;
                        break;
                    }
                }
                if(!mark){
                    diagonal=false;break;
                }
            }
            if(counter<35 && diagonal)sum+=values[0];

            //Check mid
            vector<int> mids={nums[2][0],nums[2][1],nums[2][2],nums[2][3],nums[2][4]};
            bool mid=true;
            counter=0;
            for(int i=0;i<mids.size();i++){
                int val=mids[i];
                bool mark=false;
                for(int k=0;k<numberOfBalls;k++){
                    counter++;
                    if(val==balls[k]){
                        mark=true;
                        break;
                    }
                }
                if(!mark){
                    mid=false;break;
                }
            }
            if(counter<40 && mid)sum+=values[1];

            //Check diag
            counter=0;
            bool diag=true;int j;
            for(int i=0,j=4;i<5;i++,j--){
                bool mark1=false;bool mark2=false;
                for(int k=0;k<numberOfBalls;k++){
                    counter++;
                    int val1=nums[i][i];
                    int val2=nums[j][j];
                    if(val1==balls[k])mark1=true;
                    if(val2==balls[k])mark2=true;
                    if(mark1 && mark2)break;
                }
                if(!mark1 || !mark2){
                    diag=false;break;
                }
            }
            if(counter<45 && diag)sum+=values[2];
            //Check Whole
            bool whole=true;
            bool breakloop=false;
            for(int i=0;i<5;i++){
                if(breakloop)break;
                for(int j=0;j<5;j++){
                    bool mark=false;
                    for(int k=0;k<numberOfBalls;k++){
                        if(nums[i][j]==balls[k]){
                            mark=true;break;
                        }
                    }
                    if(!mark){
                        breakloop=true;
                        whole=false;
                        break;
                    }
                }
            }
            if(whole)sum+=values[3];
            sums.push_back(sum);
        }
        cout<<"Case "<<cas++<<":"<<endl;
        for(int i : sums)cout<<i<<endl;
        sums.clear();

    }
    return 0;
}