zoukankan      html  css  js  c++  java
  • UVA

    题目描述

    Recently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new computer.

    To make the ideal computer for your needs, you decide to buy separate components and assemble the computer yourself. You need to buy exactly one of each type of component.

    The problem is which components to buy. As you all know, the quality of a computer is equal to the quality of its weakest component. Therefore, you want to maximize the quality of the component with the lowest quality, while not exceeding your budget.

    输入描述:

    On the first line one positive number: the number of testcases, at most 100. After that per testcase:
           

    One line with two integers: 1 ≤ n ≤ 1 000, the number of available components and 1 ≤ b ≤ 1 000 000 000, your budget.

    n lines in the following format: “type name price quality”, where type is a string with the type of the component, name is a string with the unique name of the component, price is an integer (0 ≤ price ≤ 1 000 000) which represents the price of the component and quality is an integer (0 ≤ quality ≤ 1 000 000 000) which represents the quality of the component (higher is better). The strings contain only letters, digits and underscores and have a maximal length of 20 characters.

    输出描述:

    Per testcase:
           

    One line with one integer: the maximal possible quality.
    示例1

    输入

    1
    18 800
    processor 3500_MHz 66 5
    processor 4200_MHz 103 7
    processor 5000_MHz 156 9
    processor 6000_MHz 219 12
    memory 1_GB 35 3
    memory 2_GB 88 6
    memory 4_GB 170 12
    mainbord all_onboard 52 10
    harddisk 250_GB 54 10
    harddisk 500_FB 99 12
    casing midi 36 10
    monitor 17_inch 157 5
    monitor 19_inch 175 7
    monitor 20_inch 210 9
    monitor 22_inch 293 12
    mouse cordless_optical 18 12
    mouse microsoft 30 9
    keyboard office 4 10

    输出

    9



    map+vector+二分
    #include <vector>
    #include <map>
    #include <iostream>
    
    using namespace std;
    typedef map<string, vector<int *>> SVmap;
    SVmap com;
    int n, b;
    
    bool ok(int m);
    
    int main() {
        int T;
        scanf("%d", &T);
        for (int i = 0; i < T; ++i) {
            int l = 1000000, r = 1, pri, q;
            char type[20], name[20];
            com.clear();
            scanf("%d%d", &n, &b);
            for (int j = 0; j < n; ++j) {
                scanf("%s%s%d%d", type, name, &pri, &q);
    //            int a[2] = {pri, q};  //vector不让存int[2]
                int *p = static_cast<int *>(malloc(2 * sizeof(int)));
                p[0] = pri, p[1] = q;
                com[type].push_back(p);
                l = min(q, l);
                r = max(q, r);
            }
            for (; l < r;) {
                int m = l + (r - l + 1) / 2;  //取两个值中较大的那个
                if (ok(m)) l = m;
                else r = m - 1;
            }
            printf("%d
    ", l);
    
        }
    }
    
    bool ok(int m) {
        int s = 0;
        for (SVmap::iterator it = com.begin(); it != com.end(); it++) {
            int mp = b + 1;
            vector<int *> &v = it->second;
            for (int i = 0; i < v.size(); ++i) {
                if (v[i][1] >= m)mp = min(mp, v[i][0]);
            }
            s += mp;
            if (s > b) return false;
        }
        return true;
    }
  • 相关阅读:
    线段树优化dp——牛客多校第一场I(好题)
    字符串dp——牛客多校第五场G
    凑出和相等的k组数,玄学结论——hdu6616
    主席树/线段树模拟归并排序+二分答案(好题)——hdu多校第4场08
    思维题+贪心——牛客多校第一场C
    线性基算贡献——19牛客多校第一场H
    俞敏洪语录
    睡眠长短决定寿命!人每天应该睡多少小时
    Java程序员从笨鸟到菜鸟之(三十一)大话设计模式(一)设计模式遵循的七大原则
    spring源码剖析(五)利用AOP实现自定义Spring注解
  • 原文地址:https://www.cnblogs.com/wangsong/p/7581567.html
Copyright © 2011-2022 走看看