#849768 (C++17(gcc12)) No.1673 Lamps on a line

• 問題: No.1673 Lamps on a line
• ユーザー: T101010101
• 提出日時: 2023-03-17 12:33:22
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 43 ms / 2,000 ms
• コード長: 5,607 bytes
• コンパイル時間: 13,243 ms
• コンパイル使用メモリ: 356,408 KB
• 最終ジャッジ日時: 2025-02-11 12:14:27
• ジャッジサーバーID （参考情報）: judge3 / judge1

ファイルパターン	結果
sample	AC * 2
other	AC * 11

ソースコード

#pragma region Macros

#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;

// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
const int MOD = 998244353;
// const int MOD = 1000000007;

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cout << fixed << setprecision(15);
}

class UnionFind {
public:

	UnionFind() = default;

    UnionFind(int n) : par(n), 
	    sz(n, 1) { iota(par.begin(), par.end(), 0); }

	int root(int x) {
		if (par[x] == x) return x;
		return (par[x] = root(par[x]));
	}

	bool unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);

        if (rx == ry) return false;
		if (sz[rx] < sz[ry]) swap(rx, ry);

		sz[rx] += sz[ry];
		par[ry] = rx;

        return true;
	}

	bool issame(int x, int y) {
		return (root(x) == root(y));
	}

	int size(int x) {
		return sz[root(x)];
	}

    int get_sum(int x) {
        return sum[root(x)];
    }

    vector<vector<int>> groups(int n) {
        vector<vector<int>> G(n);
        for (int x = 0; x < n; x++) {
            G[root(x)].push_back(x);
        }
		G.erase(
            remove_if(G.begin(), G.end(),
                [&](const vector<int>& v) { return v.empty(); }),
                    G.end());
        return G;
    }

private:
	vector<int> par;
	vector<int> sz;
    vector<int> sum;
};

template<int mod> class modint{
public:
    int val = 0;
    modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    modint(const modint &r) { val = r.val; }

    modint operator -() { return modint(-val); }
    modint operator +(const modint &r) { return modint(*this) += r; }
    modint operator +(const int &q) {modint r(q); return modint(*this) += r; }
    modint operator -(const modint &r) { return modint(*this) -= r; }
    modint operator -(const int &q) {modint r(q); return modint(*this) -= r; }
    modint operator *(const modint &r) { return modint(*this) *= r; }
    modint operator *(const int &q) {modint r(q); return modint(*this) *= r; }
    modint operator /(const modint &r) { return modint(*this) /= r; }
    modint operator /(const int &q) {modint r(q); return modint(*this) /= r; }

    modint &operator +=(const modint &r) {
        val += r.val;
        if (val >= mod) val -= mod;
        return *this;
    }
    modint &operator -=(const modint &r) {
        if (val < r.val) val += mod;
        val -= r.val;
        return *this;
    }
    modint &operator *=(const modint &r) {
        val = val * r.val % mod;
        return *this;
    }
    modint &operator /=(const modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % mod;
        if (val < 0) val += mod;
        return *this;
    }

    bool operator ==(const modint& r) { return this -> val == r.val; }
    bool operator <(const modint& r) { return this -> val < r.val; }
    bool operator !=(const modint& r) { return this -> val != r.val; }
};

using mint = modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t;
    x = t;
    return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}

mint modpow(const mint &a, int n) {
    if (n == 0) return 1;
    mint t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
}

int modpow(int x, int n, int mod) {
    int ret = 1;
    while (n > 0) {
        if (n % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        n /= 2;
    }
    return ret;
}

int POW(int x, int y) {
    if (y != (int)(y) or y < 0 or x != 0 && x != 1 && y > 64) {cout << "Error" << endl;return 0;}
    if (y == 0) return 1;
    if (y % 2 == 0) return POW(x * x, y / 2);
    return x * POW(x, y - 1);
}
int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }

#pragma endregion

struct BIT {
    int N;             // 要素数
    vector<int> bit[2];  // データの格納先
    BIT(int N_) { init(N_); }
    void init(int N_) {
        N = N_ + 1;
        bit[0].assign(N, 0);
        bit[1].assign(N, 0);
    }

    void add_sub(int p, int i, int x) {
        while (i < N) {
            bit[p][i] += x;
            i += (i & -i);
        }
    }
    void add(int l, int r, int x) {  // [l, r) に加算
        add_sub(0, l, -x * (l - 1));
        add_sub(0, r, x * (r - 1));
        add_sub(1, l, x);
        add_sub(1, r, -x);
    }

    int sum_sub(int p, int i) {
        int ret = 0;
        while (i > 0) {
            ret += bit[p][i];
            i -= (i & -i);
        }
        return ret;
    }
    int sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }
    int sum(int l, int r) { return sum(r - 1) - sum(l - 1); }
};

signed main() {
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N);
    
    int sum = 0;
    for (int q = 0; q < Q; q++) {
        int l, r;
        cin >> l >> r;
        l--; r--;
        for (int j = l; j <= r; j++) {
            if (A[j]) sum--;
            else sum++;
            A[j] ^= 1;
        }
        cout << sum << endl;
    }
}