-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcelebrity.c++
79 lines (64 loc) · 1.02 KB
/
celebrity.c++
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
#include<iostream>
#include<vector>
#include<stack>
using namespace std;
bool knows(vector<vector<int>> v, int a, int b, int n)
{
if(v[a][b] == 1)
{
return true;
}
else
{
return false;
}
}
int celebrity(vector<vector<int> > v, int n)
{
stack<int> s;
for(int i = 0; i < n; i++)
{
s.push(i);
}
while (s.size() > 1)
{
int a = s.top();
s.pop();
int b = s.top();
s.pop();
if(knows(v, a, b, n))
{
s.push(b);
}
else
{
s.push(a);
}
}
int ans = s.top();
int zeroCount = 0;
for(int i = 0; i < n; i++)
{
if(v[ans][i] == 0)
{
zeroCount++;
}
}
if(zeroCount != n)
return -1;
int oneCount = 0;
for(int i = 0; i < n; i++)
{
if(v[i][ans] == 1)
{
oneCount++;
}
}
if(oneCount != n)
return -1;
return ans;
}
int main()
{
return 0;
}