24h購物| | PChome| 登入
2012-09-02 12:17:05| 人氣1,984| 回應0 | 上一篇 | 下一篇

[UVA] 1237 - Expert Enough?

推薦 0 收藏 0 轉貼0 訂閱站台

Auto-mobile Charting & Manufacturing (ACM) is a company that specializes in manufacturing automobile spare parts. Being one of the leading automotive companies in the world, ACM are sure to keep up the latest information in that world. In the 100-year anniversary of the company, ACM compiled a huge list of range of prices of any automobiles ever recorded in the history. ACM then wants to develop a program that they called Automobile Expert System or AES for short.

The program receives a price P as an input, and searches through the database for a car maker in which P falls in their range of lowest price L and highest price H of car they ever made. The program then output the car maker name. If the database contains no or more than one car maker that satisfies the query, the program produce output ``UNDETERMINED" (without quotes). Not so expert, huh? You are about to develop that program for ACM.

Input 

The input begins with a line containing an integer T (T$ le$10) , the number of test cases follow. Each case begins with the size of the database D (D < 10000) . The next each of D lines contains M , L and H (0 < L < H < 1000000) which are the name of the maker (contains no whitespace and will never exceeds 20 characters), the car's lowest price the maker ever made, and the car's highest price the maker ever made respectively. Then there is the number of query Q (Q < 1000) . follows. Each of the next Q lines contains an integer P (0 < P < 1000000) , the query price.

Output 

Output for each query should be one line containing the name of the maker, or the string ``UNDETERMINED" (without quotes) if there is no maker or more than one maker that satisfies the query. You should separate output for different case by one empty line.

Sample Input 

1 
4 
HONDA 10000 45000 
PEUGEOT 12000 44000 
BMW 30000 75900 
CHEVROLET 7000 37000 
4 
60000 
7500 
5000 
10000

Sample Output 

BMW 
CHEVROLET 
UNDETERMINED 
UNDETERMINED


#include <stdio.h>

int main() {
int t;
scanf("%d", &t);
while(t--) {
int n, m, p;
int l[10000], h[10000];
int i;
char name[10000][25];
scanf("%d", &n);
for(i = 0; i < n; i++)
scanf("%s %d %d", name[i], &l[i], &h[i]);
scanf("%d", &m);
while(m--) {
scanf("%d", &p);
int cnt = 0, mi;
for(i = 0; i < n; i++) {
if(l[i] <= p && p <= h[i])
cnt++, mi = i;
if(cnt > 1) break;
}
if(cnt == 1)
puts(name[mi]);
else
puts("UNDETERMINED");
}
if(t)
puts("");
}
return 0;
}
 

台長: Morris
人氣(1,984) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA] 927 - Integer Sequences from Addition of Terms
此分類上一篇:[UVA] 10365 - Blocks

是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入圖片中算式的結果(可能為0) 
(有*為必填)
TOP
詳全文