zoukankan      html  css  js  c++  java
  • 洛谷 P1201 [USACO1.1]贪婪的送礼者Greedy Gift Givers

    贪婪的送礼者Greedy Gift Givers

    难度:☆

    Code:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    //Mystery_Sky
    //
    struct People{
        char name[20];
        int out, in;
    }people[100];
    int n;
    char name[20], name1[20];
    inline int search_name(char name[])
    {
        int a;
        for(int j = 1; j <= n; j++) {
            if((strcmp(name, people[j].name) == 0)) {
                    a = j;
                    break;
            }
        }
        return a;
    }
    
    inline void solve()
    {
        for(int i = 1; i <= n; i++) {
            scanf("%s", name);
            int a;
            a = search_name(name);
            int b, c;
            getchar();
            scanf("%d%d", &b, &c);
            if(c == 0) continue;
            int out = b / c;
            people[a].out = people[a].out + out * c;
            for(int j = 1; j <= c; j++) {
                scanf("%s", name1);
                getchar();
                int d = search_name(name1);
                people[d].in += out;
            }
        }
    }
    
    inline void print()
    {
        for(int i = 1; i <= n; i++) {
            printf("%s ", people[i].name);
            printf("%d
    ", people[i].in - people[i].out);
        }
    }
    
    int main() {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) scanf("%s", people[i].name);
        getchar();
        solve();
        print();
        return 0;
    }
    
    唯愿,青春不辜负梦想,未来星辰闪耀
  • 相关阅读:
    React 事件机制
    EggJs学习 (一)
    css 选择器及样式属性
    css盒子模型
    ES5 继承方式
    正则表达式
    Flex布局
    npm
    深拷贝、浅拷贝
    Webpack实战(入门、进阶与调优)
  • 原文地址:https://www.cnblogs.com/Benjamin-cpp/p/10951561.html
Copyright © 2011-2022 走看看