zoukankan      html  css  js  c++  java
  • hdu 3038 How Many Answers Are Wrong

    How Many Answers Are Wrong

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1475 Accepted Submission(s): 596


    Problem Description
    TT and FF are ... friends. Uh... very very good friends -________-b

    FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a sequence of integers-_-!!(bored).

    Then, FF can choose a continuous subsequence from it(for example the subsequence from the third to the fifth integer inclusively). After that, FF will ask TT what the sum of the subsequence he chose is. The next, TT will answer FF's question. Then, FF can redo this process. In the end, FF must work out the entire sequence of integers.

    Boring~~Boring~~a very very boring game!!! TT doesn't want to play with FF at all. To punish FF, she often tells FF the wrong answers on purpose.

    The bad boy is not a fool man. FF detects some answers are incompatible. Of course, these contradictions make it difficult to calculate the sequence.

    However, TT is a nice and lovely girl. She doesn't have the heart to be hard on FF. To save time, she guarantees that the answers are all right if there is no logical mistakes indeed.

    What's more, if FF finds an answer to be wrong, he will ignore it when judging next answers.

    But there will be so many questions that poor FF can't make sure whether the current answer is right or wrong in a moment. So he decides to write a program to help him with this matter. The program will receive a series of questions from FF together with the answers FF has received from TT. The aim of this program is to find how many answers are wrong. Only by ignoring the wrong answers can FF work out the entire sequence of integers. Poor FF has no time to do this job. And now he is asking for your help~(Why asking trouble for himself~~Bad boy)
     
    Input
    Line 1: Two integers, N and M (1 <= N <= 200000, 1 <= M <= 40000). Means TT wrote N integers and FF asked her M questions.

    Line 2..M+1: Line i+1 contains three integer: Ai, Bi and Si. Means TT answered FF that the sum from Ai to Bi is Si. It's guaranteed that 0 < Ai <= Bi <= N.

    You can assume that any sum of subsequence is fit in 32-bit integer.
     
    Output
    A single line with a integer denotes how many answers are wrong.
     
    Sample Input
    10 5
    1 10 100
    7 10 28
    1 3 32
    4 6 41
    6 6 1
     
    Sample Output
    1
     
    Source
     
    Recommend
    gaojie
     
     
    并查集
    #include<stdio.h>
    #include<string.h>
    #include<cstdlib>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    struct st
    {
        int l;
        int r;
        int num;
    }a[40003];
    int b[80003],blen;
    int c[80003],clen;
    int f[80003];
    int r[80003];
    void chuli()
    {
        int i;
        clen=0;
        if(blen>=1)
        c[++clen]=b[1];
        for(i=2;i<=blen;i++)
        {
            if(b[i]==b[i-1])
                continue;
            c[++clen]=b[i];
        }
        for(i=0;i<=clen;i++)
        {
            f[i]=i;
            r[i]=0;
        }
    }
    int EF(int l,int r,int num)
    {
        int mid=(l+r)/2;
        while(l<r)
        {
            if(c[mid]>num)
                r=mid-1;
            else if(c[mid]<num)
                l=mid+1;
            else if(c[mid]==num)
                return mid;
            mid=(l+r)/2;
        }
        return mid;
    }
    int find(int x)
    {
        int t;
        if(x==f[x])
            return x;
        t=find(f[x]);
        r[x]=r[x]+r[f[x]];
        f[x]=t;
        return t;
    }
    int Union(int x,int y,int num)
    {
        int x1,y1,tmp;
        x1=find(x);
        y1=find(y);
        if(x1==y1)
        {
            tmp=r[x]-r[y];
            if(tmp<0) tmp=-tmp;
            if(tmp==num)
                return 0;
            else return 1;
        }
        else 
        {
            if(x1<y1)
            {
                f[y1]=x1;
                r[y1]=num+r[x]-r[y];
            }
            else 
            {
                f[x1]=y1;
                r[x1]=r[y]-num-r[x];
            }
        }
        return 0;
    }
    int main()
    {
        int n,m,i,k,num,x,y;
        while(scanf("%d%d",&n,&m)>0)
        {
            blen=0;
            for(i=1;i<=m;i++)
            {
                scanf("%d%d%d",&a[i].l,&a[i].r,&a[i].num);
                b[++blen]=a[i].l;
                b[++blen]=a[i].r;
            }
            sort(b+1,b+1+blen);
            chuli();
            for(i=1,num=0;i<=m;i++)
            {
                x=EF(1,clen,a[i].l);
                y=EF(1,clen,a[i].r);
                k=Union(x-1,y,a[i].num);
                if(k==1) num++;
            }
            printf("%d
    ",num);
        }
        return 0;
    }
  • 相关阅读:
    新人优惠的风险
    Linux服务器记录并查询历史操作记录
    斜率比截距重要
    专访李果:初生牛犊不怕虎的移动创业者
    iPhone开发视频教程 ObjectiveC部分 (51课时)
    珍藏40个android应用源码分享
    iPhone开发教程 UI基础课程(58课时)
    ios源码分享之动画类
    史上最全的ios源码汇总。欢迎收藏
    Android开发教程汇总
  • 原文地址:https://www.cnblogs.com/tom987690183/p/3164258.html
Copyright © 2011-2022 走看看