提出 #10169734

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define Mid ((L + R) >> 1)
#define Left (Node << 1)
#define Right (Node << 1 | 1)

using namespace std;

typedef pair <int,int> pii;

const int N = 200200;
const int M = 4 * N;
const int Inf = 2e9;

int n, m;
int A[N];
pii a[N];
set <pii> Have[N];
vector <pii> Cur[N];

int Tree[M];
int Lazy[M];

void Merge(int Node)
{
    Tree[Node] = Tree[Left] ^ Tree[Right];
}

void PushLazy(int Node, int Len)
{
    if(Lazy[Node])
    {
        Tree[Node] ^= Lazy[Node];

        if(Len > 1)
        {
            Lazy[Left] ^= Lazy[Node];
            Lazy[Right] ^= Lazy[Node];
        }

        Lazy[Node] = 0;
    }
}

void Build(int Node = 1, int L = 0, int R = n - 1)
{
    Tree[Node] = Lazy[Node] = 0;

    if(L == R)  return void(Tree[Node] = A[L]);

    Build(Left, L, Mid);
    Build(Right, Mid + 1, R);

    Merge(Node);
}

void Update(int i, int j, int x, int Node = 1, int L = 0, int R = n - 1)
{
    PushLazy(Node, R - L + 1);

    if(i > j || L > R)  return ;
    if(j < L || R < i)  return ;

    if(i <= L && R <= j)
    {
        Lazy[Node] ^= x;
        return PushLazy(Node, R - L + 1);
    }

    Update(i, j, x, Left, L, Mid);
    Update(i, j, x, Right, Mid + 1, R);

    Merge(Node);
}

int Query(int i, int j, int Node = 1, int L = 0, int R = n - 1)
{
    PushLazy(Node, R - L + 1);

    if(i > j || L > R)      return 0;
    if(j < L || R < i)      return 0;
    if(i <= L && R <= j)    return Tree[Node];

    return Query(i, j, Left, L, Mid) ^ Query(i, j, Right, Mid + 1, R);
}

int main()
{
    cin >> n >> m;

    for(int i = 0; i < n; i++)  scanf("%d%d", &a[i].first, &a[i].second);

    sort(a, a + n);

    for(int i = 0; i < n; i++)  A[i] = a[i].second;

    for(int i = 0; i < m; i++)
    {
        int L, R;   scanf("%d%d", &L, &R);

        L = lower_bound(a, a + n, pii(L, -Inf)) - a;
        R = upper_bound(a, a + n, pii(R, +Inf)) - 1 - a;

        if(L > R) continue;

        Have[L].insert(pii(R, i));
    }

    Build();

    vector <bool> Used(m, false);

    for(int i = 0; i < n; i++)
    {
        for(pii p : Have[i])    Cur[i].push_back(p);

        Have[i].clear();

        int Last = i;

        for(pii p : Cur[i])
        {
            if(Last <= p.first)
            {
                Have[Last].insert(pii(p.first, p.second));
                Last = p.first + 1;
            }
        }

        if(Query(i, i))
        {
            if(Have[i].empty()) return 0 * puts("-1");

            Update(i, (*Have[i].begin()).first, 1);

            Used[(*Have[i].begin()).second] = true;
        }
    }

    for(int i = n - 1; ~i; --i)
    {
        reverse(Cur[i].begin(), Cur[i].end());

        bool Last = false;

        for(pii p : Cur[i])
        {
            Used[p.second] = Last ^ Used[p.second];
            Last ^= Used[p.second];
        }

        reverse(Cur[i].begin(), Cur[i].end());
    }

    vector <int> Ans;

    for(int i = 0; i < m; i++)
        if(Used[i])
            Ans.push_back(i);

    cout << Ans.size() << endl;
    for(int x : Ans)    printf("%d ", x + 1);
    puts("");
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:90:73: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n; i++)  scanf("%d%d", &a[i].first, &a[i].second);
                                                                         ^
./Main.cpp:98:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         int L, R;   scanf("%d%d", &L, &R);
                                          ^

ジャッジ結果