-
Notifications
You must be signed in to change notification settings - Fork 1
/
IceCreamP.cpp
79 lines (59 loc) · 1.6 KB
/
IceCreamP.cpp
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
// problem: "https://www.hackerrank.com/challenges/icecream-parlor/problem"
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,n,t,m,x,y;
cin>>t;
for(i=0;i!=t;i++)
{
cin>>m>>n;
vector<int>flavours(n);
for(j=0;j!=n;j++)
cin>>flavours[j];
vector<int>copy(flavours);
sort(flavours.begin(),flavours.end());
//for(j=0;j!=n;j++)
// cout<<flavours[j]<<" ";
//cout<<'\n';
j=0;
while(1)
{
if(m-flavours[j]!=flavours[j])
{
if(binary_search(flavours.begin(),flavours.end(),m-flavours[j]))
{
x=flavours[j];
y=m-flavours[j];
for(int k=0;k!=n;k++)
{
if(x==copy[k])
cout<<k+1<<" ";
else if(y==copy[k])
cout<<k+1<<" ";
}
cout<<'\n';
break;
}
}
else
{
if(flavours[j+1]==flavours[j])
{
x=y=flavours[j];
for(int k=0;k!=n;k++)
{
if(x==copy[k])
cout<<k+1<<" ";
else if(y==copy[k])
cout<<k+1<<" ";
}
cout<<'\n';
break;
}
}
j++;
}
}
return 0;
}