Code/P178PROB.cpp at master · kiwiahn/Code · 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
#include<iostream>

using namespace std;


int const maxn = 1000000;

int p[maxn],a[maxn],b[maxn];
int fi[maxn],se[maxn],th[maxn];

int main(void){
	int n,max,max1,max2,max3;
	int m,k,j,key;

	while( 1 ){
		for(int i =1 ; i <= max1;i++){
			p[i] = 0;
			b[i] = 0;
			fi[i] = 0;
			se[i] = 0;
			th[i] = 0;
		}
		max=0;
		max1=0;
		max2=0;
		max3=0;
		k=0;
		j=1;
		cin>>n;
		if(n == 0){
			break;
		}
		while(n > 0){
			cin>>m;
			for(int i = 1;i <= m; i++){
				cin>>a[i];
				if(i == 1){
					p[a[i]]+=3;
					fi[a[i]]++;
				}
				if(i == 2){
					p[a[i]]+=2;
					se[a[i]]++;
				}
				if(i == 3){
					p[a[i]]++;
					th[a[i]]++;
				}
				if(p[a[i]] > max){
					max = p[a[i]];
				}
				if(a[i] > max1){
					max1=a[i];
				}
			}
			n--;
		}
		for(int i = 1; i <= max1;i++){
			if(p[i] == max){
				b[j]=i;
				j++;
				k++;
			}
		}
		if(k == 1){
			cout<<b[1];
		}
		if(k > 1){
			k=0;
			max=0;
			for(int i = 1;i < j;i++){
				if(fi[b[i]] >= max){
					max = fi[b[i]];
				}
			}
			for(int i = 1;i < j; i++){
				if(fi[b[i]] == max){
					key = b[i];
					k++;
				}
			}
			if(k == 1){
				cout<<key;
			}
			if(k > 1){
				k=0;
				for(int i = 1;i < j;i++){
					if(fi[b[i]] == max && se[b[i]] >= max2){
						max2 = se[b[i]];
					}
				}
				for(int i = 1;i < j; i++){
					if(se[b[i]] == max2 && fi[b[i]] == max){
						key = b[i];
						k++;
					}
				}
				if(k == 1){
					cout<<key;
				}
				if(k > 1){
					for(int i = 1;i < j;i++){
						if(fi[b[i]] == max && se[b[i]] == max2 && th[b[i]] >= max3){
							max3 = th[b[i]];
						}
					}
					for(int i = 1;i < j; i++){
						if(se[b[i]] == max2 && fi[b[i]] == max && th[b[i]] == max3){
							cout<<b[i]<<" ";
						}
					}
				}
			}
		}
		cout<<endl;

	}
	return 0;
}