24h購物| | PChome| 登入
2013-06-28 09:16:34| 人氣820| 回應0 | 上一篇 | 下一篇

[UVA][Easy] 10919 - Prerequisites

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

Problem E: Prerequisites?

Freddie the frosh has chosen to take k courses. To meet the degree requirements, he must take courses from each of several categories. Can you assure Freddie that he will graduate, based on his course selection?

Input consists of several test cases. For each case, the first line of input contains 1 ≤ k ≤ 100, the number of courses Freddie has chosen, and 0 ≤ m ≤ 100, the number of categories. One or more lines follow containing k 4-digit integers follow; each is the number of a course selected by Freddie. Each category is represented by a line containing 1 ≤ c ≤ 100, the number of courses in the category, 0 ≤ r ≤ c, the minimum number of courses from the category that must be taken, and the c course numbers in the category. Each course number is a 4-digit integer. The same course may fulfil several category requirements. Freddie's selections, and the course numbers in any particular category, are distinct. A line containing 0 follows the last test case.

For each test case, output a line containing "yes" if Freddie's course selection meets the degree requirements; otherwise output "no."

Sample Input

3 2
0123 9876 2222
2 1 8888 2222
3 2 9876 2222 7654 
3 2
0123 9876 2222
2 2 8888 2222
3 2 7654 9876 2222
0

Output for Sample Input

yes
no

Gordon V. Cormack


詢問能不能符合畢業門檻, 畢業門檻就是分類中至少要選幾門課。
然後已經知道他已經過了多少門課的課號。

#include <stdio.h>
int main() {
    int n, m, i, x, r, c;
    while(scanf("%d %d", &n, &m) == 2) {
        int mark[10000] = {};
        for(i = 0; i < n; i++)
            scanf("%d", &x), mark[x] = 1;
        int ok = 1;
        for(i = 0; i < m; i++) {
            scanf("%d %d", &r, &c);
            int cnt = 0;
            while(r--) {
                scanf("%d", &x);
                cnt += mark[x];
            }
            ok &= cnt >= c;
        }
        puts(ok ? "yes" : "no");
    }
    return 0;
}

台長: Morris
人氣(820) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA] 10920 - Spiral Tap
此分類上一篇:[UVA] 12636 - Disguised Giveaway

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