zoukankan      html  css  js  c++  java
  • Judging Troubles (multiset查找) 分类: ACM STL

    Judging Troubles
    Time Limit: 5000ms, Special Time Limit:12500ms, Memory Limit:65536KB
    Total submit users: 91, Accepted users: 72
    Problem 13352 : No special judgement
    Problem description

    The NWERC organisers have decided that they want to improve the automatic grading of the submissions for the contest, so they now use two systems: DOMjudge and Kattis. Each submission is judged by both systems and the grading results are compared to make sure that the systems agree. However, something went wrong in setting up the connection between the systems, and now the jury only knows all results of both systems, but not which result belongs to which submission! You are therefore asked to help them figure out how many results could have been consistent.

    Input

    The input consists of:

    • one line with one integer n (1 ≤ n ≤ 10^5), the number of submissions;

    • n lines, each with a result of the judging by DOMjudge, in arbitrary order;

    • n lines, each with a result of the judging by Kattis, in arbitrary order.

    Each result is a string of length between 5 and 15 characters (inclusive) consisting of lowercase letters.

    Output

    Output one line with the maximum number of judging results that could have been the same for both systems.

    Sample Input
    5
    correct
    wronganswer
    correct
    correct
    timelimit
    wronganswer
    correct
    timelimit
    correct
    timelimit

    Sample Output
    4

    Problem Source
    NWERC 2014
    题意就是看看给出的两个评测系统的n的结果,让你求有多少个是相同的提交。
    用multiset,也可以用map做

    #include<stdio.h>
    #include<string.h>
    #include<set>
    #include<vector> 
    #include<algorithm>
    #include<iostream>
    #include<string>
    #include<stdlib.h> 
    #define maxn 100000+100 
    using namespace std;
    char str[maxn];
    char ch[maxn];
    string ss;
    int main()
    {
        int n;
        multiset<string>S;
        scanf("%d",&n);
        getchar();
        for(int i=0;i<n;i++)
        {
           scanf("%s",str);
            S.insert(str);
        }
        //printf("%d
    ",S.size());
        int count=0;
        for(int i=0;i<n;i++)
        {
            scanf("%s",ch);
            multiset<string>::iterator it;
            it=S.find(ch);
            if(it!=S.end())
            {
                count++;
                S.erase(it);
            }    
        }
        printf("%d
    ",count);
        return 0;
    }
    //map版本
    #include<stdio.h>
    #include<string.h>
    #include<set>
    #include<vector>
    #include<algorithm>
    #include<iostream>
    #include<string>
    #include<stdlib.h>
    #include<map>
    #define maxn 100000+100
    using namespace std;
    char str[maxn];
    char ch[maxn];
    string ss;
    int main()
    {
        int n;
        map<string,int>S;
        S.clear();
        scanf("%d",&n);
        getchar();
        for(int i=0;i<n;i++)
        {
    
            scanf("%s",str); 
            S[str]++;
        }
        //printf("%d
    ",S.size());
        int count=0;
        for(int i=0;i<n;i++)
        {
            scanf("%s",ch) ;
            if(S[ch]>0)
            {
                count++;
                S[ch]--; 
            }
        }
        printf("%d
    ",count);
        return 0;
    }
    
    
    
  • 相关阅读:
    负载均衡获得真实源IP的6种方法
    美图全链路监控实战
    移动端APM网络监控与优化方案
    k8s 如何对外提供服务
    mysql5.7安装audit审计插件
    mysql 5.7安装密码校验插件validate_password
    Linux Crontab 定时任务
    stm32 hard fault usage fault UNALIGNED -> task stack overflow
    linux逻辑卷管理(LVM)
    suse11开启telnet服务
  • 原文地址:https://www.cnblogs.com/NaCl/p/9580186.html
Copyright © 2011-2022 走看看