-
Notifications
You must be signed in to change notification settings - Fork 0
/
1237 - Expert Enough.cpp
76 lines (76 loc) · 1.54 KB
/
1237 - Expert Enough.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
/*
||-----------------------------------||
|| Rahat Khan Pathan ||
|| BGC Trust University ||
|| Department of CSE ||
||-----------------------------------||
*/
#include<bits/stdc++.h>
#define ll long long int
#define pub push_back
#define PI 3.14159265359
#define vll vector<ll>
#define All(X) (X).begin(),(X).end()
#define Unique(X) (X).erase(unique(All(X)),(X).end()))
#define fast ios_base::sync_with_stdio(0); cin.tie(0);
#define pi pair<ll,ll>
#define vpair vector<pair<ll,ll> >
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define minus cout<<-1<<endl
using namespace std;
class car
{
public:
string name;
ll low,high;
};
void solve()
{
ll n,low,high,i,j,c;
string name,ans;
cin>>n;
car data[n+1];
for(i=0;i<n;i++)
{
cin>>name>>low>>high;
data[i].name=name;
data[i].low=low;
data[i].high=high;
}
ll q,x;
cin>>q;
for(i=0;i<q;i++)
{
cin>>x;
c=0;
for(j=0;j<n;j++)
{
name=data[j].name;
high=data[j].high;
low=data[j].low;
if(x<=high && x>=low)
{
ans=name;
c++;
}
}
if(c==1)
cout<<ans<<endl;
else
cout<<"UNDETERMINED"<<endl;
}
}
int main()
{
fast;
ll t;
cin>>t;
while(t--)
{
solve();
if(t)
cout<<endl;
}
return 0;
}