提出 #68960371

---

ソースコード 拡げる

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

#include <atcoder/lazysegtree>
using ll = long long;
ll op(ll x, ll y) { return x + y; }
ll e() { return 0; }
ll mapping(bool f, ll x) { return f ? 0 : x; }
bool id() { return false; }
bool composition(bool f, bool g) { return f or g; }
using lazyseg = atcoder::lazy_segtree<ll, op, e, bool, mapping, composition, id>;

int main() {
	int q;
	cin >> q;
	int n = q + 1;
	vector<pair<int, int>> queries(q);
	for (int i = 0; i < q; i++) {
		int type, x;
		cin >> type >> x;
		if (type == 1) {
			queries[i] = {x, -1};
		} else {
			int y;
			cin >> y;
			queries[i] = {x, y};
		}
	}
	
	vector<vector<int>> next(n);
	for (int i = 1; i <= q; i++) {
		auto [x, y] = queries[i - 1];
		if (y == -1) next[x].push_back(i);
	}
	vector<int> b;
	stack<int> st;
	st.push(0);
	while (!st.empty()) {
		int x = st.top(); st.pop();
		b.push_back(x);
		for (auto y : next[x]) st.push(y);
	}
	
	vector<int> p(n);
	for (int i = 0; i < b.size(); i++) p[b[i]] = i;
	lazyseg seg(n);
	for (int i = 1; i <= q; i++) {
		auto [x, y] = queries[i - 1];
		if (y == -1) {
			seg.set(p[i], i);
		} else {
			int l = p[x], r = p[y];
			if (l > r) swap(l, r);
			l++;
			ll sum = seg.prod(l, r);
			seg.apply(l, r, true);
			cout << sum << "\n";
		}
	}
}

提出情報

コンパイルエラー

Main.cpp: In function ‘int main()’:
Main.cpp:45:27: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   45 |         for (int i = 0; i < b.size(); i++) p[b[i]] = i;
      |                         ~~^~~~~~~~~~

ジャッジ結果