提出 #577690

---

ソースコード 拡げる

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>          //cout<<fixed<<setprecision(10);
//#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
//#include <memory.h>
#include <cassert>

#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) ((int)strlen(X))
#define F first
#define S second
#define IOS ios_base::sync_with_stdio(0)
#ifdef ONLINE_JUDGE
#define FILEIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#else
#define FILEIO(name)
#endif

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
/*#include<complex>
typedef complex<double> cd;
#define X real()
#define Y imag()*/

struct node{
    int l,r;
    node *lp,*rp;
    int u,v;
    bool mark;
}nodepool[10000000],*ntp;

node* newnode(){
    ntp->u=ntp->v=0;
    ntp->lp=ntp->rp=NULL;
    ntp->l=ntp->r=0;
    ntp->mark=false;
    return ntp++;
}

void build(node *&x,int L,int R){
    x->l=L;
    x->r=R;
    if(L<R){
        int M=(L+R)/2;
        x->lp=newnode();
        x->rp=newnode();
        build(x->lp,L,M);
        build(x->rp,M+1,R);
    }
}

void mk(node *x,int U,int V){
    if(x->mark){
        if(x->v==U)x->v=V;
        else x->v=-1;
    }
    else{
        x->mark=1;
        x->u=U;
        x->v=V;
    }
}

void go(node *x,int L,int R,int X){
    if(L>x->r||R<x->l)return;
    else if(L<=x->l&&R>=x->r){
        mk(x,X-1,X);
        return;
    }
    else{
        if(x->mark){
            x->mark=0;
            mk(x->lp,x->u,x->v);
            mk(x->rp,x->u,x->v);
        }
        go(x->lp,L,R,X);
        go(x->rp,L,R,X);
    }
}

int ans=0;
void fuck(node *x,int k){
    if(x->l!=x->r){
        if(x->mark){
            x->mark=0;
            mk(x->lp,x->u,x->v);
            mk(x->rp,x->u,x->v);
        }
        fuck(x->lp,k);
        fuck(x->rp,k);
    }
    else{
        if(x->u==0&&x->v==k)ans++;
    }
}

int main()
{
    ntp=nodepool;
    node *root=newnode();
    DRII(n,k);
    build(root,1,n);
    root->mark=1;
    DRI(T);
    int L,R,X;
    while(T--){
        RIII(L,R,X);
        go(root,L,R,X);
    }
    fuck(root,k);
    cout<<ans<<endl;
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:138:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     DRII(n,k);
              ^
./Main.cpp:141:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     DRI(T);
           ^
./Main.cpp:144:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         RIII(L,R,X);
                    ^

ジャッジ結果