Submission #50020474

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ll = long long int;
constexpr int kN = 200'000 + 10;

struct SegTree
{
    struct Node
    {
        int lIdx = -1;
        int rIdx = -1;
        ll sum = 0;
    };

    vector<Node> nodes;
    array<int, kN> roots;
    int curIdx;

    int GenNewNode()
    {
        nodes.emplace_back();
        return static_cast<int>( nodes.size() ) - 1;
    }

    int CopyNode( int idx )
    {
        nodes.emplace_back( nodes[idx] );
        return static_cast<int>( nodes.size() ) - 1;
    }

    void Init( int nodeIdx, int l, int r )
    {
        if( l < r )
        {
            nodes[nodeIdx].lIdx = GenNewNode();
            nodes[nodeIdx].rIdx = GenNewNode();

            int mid = ( l + r ) >> 1;
            Init( nodes[nodeIdx].lIdx, l, mid );
            Init( nodes[nodeIdx].rIdx, mid + 1, r );
        }

        return;
    }

    void Init( int l, int r )
    {
        curIdx = 0;
        roots[0] = GenNewNode();
        Init( roots[0], l, r );
        return;
    }

    void Add( int nodeIdx, int l, int r, int pos, ll a )
    {
        nodes[nodeIdx].sum += a;

        if( l < r ) [[likely]]
        {
            int mid = ( l + r ) >> 1;

            if( pos <= mid )
            {
                nodes[nodeIdx].lIdx = CopyNode( nodes[nodeIdx].lIdx );
                Add( nodes[nodeIdx].lIdx, l, mid, pos, a );
            }
            else
            {
                nodes[nodeIdx].rIdx = CopyNode( nodes[nodeIdx].rIdx );
                Add( nodes[nodeIdx].rIdx, mid + 1, r, pos, a );
            }
        }

        return;
    }

    void AddO( int l, int r, int pos, ll a )
    {
        curIdx++;
        roots[curIdx] = CopyNode( roots[curIdx - 1] );
        Add( roots[curIdx], l, r, pos, a );
        return;
    }

    ll Ask( int nodeLIdx, int nodeRIdx, int l, int r, int pos ) const
    {
        if( l == r )
            return nodes[nodeRIdx].sum - nodes[nodeLIdx].sum;
        else [[likely]]
        {
            int mid = ( l + r ) >> 1;

            if( pos <= mid )
                return Ask( nodes[nodeLIdx].lIdx, nodes[nodeRIdx].lIdx, l, mid, pos );
            else
                return ( nodes[nodes[nodeRIdx].lIdx].sum - nodes[nodes[nodeLIdx].lIdx].sum ) + Ask( nodes[nodeLIdx].rIdx, nodes[nodeRIdx].rIdx, mid + 1, r, pos );
        }
    }

    ll AskO( int L, int R, int l, int r, int pos ) const
    {
        return Ask( roots[L - 1], roots[R], l, r, pos );
    }

} segTree;

array<ll, kN> a, l, r, x, ans;

int main()
{
    int n; scanf( "%d", &n );
    for( int i = 1; i <= n; i++ ) scanf( "%lld", &a[i] );
    int q; scanf( "%d", &q );
    for( int i = 1; i <= q; i++ ) scanf( "%lld%lld%lld", &l[i], &r[i], &x[i] );

    vector<ll> as( n );
    for( int i = 1; i <= n; i++ ) as[i - 1] = a[i];
    sort( as.begin(), as.end() );
    as.resize( unique( as.begin(), as.end() ) - as.begin() );
    int asSz = static_cast<int>( as.size() );

    segTree.Init( 0, asSz - 1 );
    for( int i = 1; i <= n; i++ )
    {
        int aId = lower_bound( as.begin(), as.end(), a[i] ) - as.begin();
        segTree.AddO( 0, asSz - 1, aId, a[i] );
    }

    for( int i = 1; i <= q; i++ )
    {
        l[i] ^= ans[i - 1];
        r[i] ^= ans[i - 1];
        x[i] ^= ans[i - 1];
        int xId = ( upper_bound( as.begin(), as.end(), x[i] ) - as.begin() ) - 1;

        if( xId >= 0 ) [[likely]]
            ans[i] = segTree.AskO( l[i], r[i], 0, asSz - 1, xId );
    }

    for( int i = 1; i <= q; i++ ) printf( "%lld\n", ans[i] );
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:112:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  112 |     int n; scanf( "%d", &n );
      |            ~~~~~^~~~~~~~~~~~
Main.cpp:113:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  113 |     for( int i = 1; i <= n; i++ ) scanf( "%lld", &a[i] );
      |                                   ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:114:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  114 |     int q; scanf( "%d", &q );
      |            ~~~~~^~~~~~~~~~~~
Main.cpp:115:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  115 |     for( int i = 1; i <= q; i++ ) scanf( "%lld%lld%lld", &l[i], &r[i], &x[i] );
      |                                   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result