Submission #1515770

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-9;
const bool debug = 0;
//---------------------------------//

// 区間add, 区間gcd
struct LazySegTree {
	vector<ll> node, sum, lazy;
	int n;
	
	LazySegTree(int _n) {
		n = 1;
		while (n < _n) n *= 2;
		node.resize(n * 2 - 1, 0);
		sum.resize(n * 2 - 1, 0);
		lazy.resize(n * 2 - 1, 0);
	}
		
	ll gcd(ll a, ll b) {
		if (b == 0) return a;
		return gcd(b, a % b);
	}
	
	void eval(int k, int l, int r) {
		if (lazy[k] == 0) return;
		sum[k] += lazy[k];
		if (r - l > 1) {
			lazy[k * 2 + 1] += lazy[k] / 2;
			lazy[k * 2 + 2] += lazy[k] / 2;
		}
		lazy[k] = 0;
	}
	
	void sumadd(int a, int b, ll x, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = n;
		eval(k, l, r);
		if (a >= r || b <= l) return;
		if (a <= l && r <= b) {
			lazy[k] += x * (r - l);
			eval(k, l, r);
		}
		else {
			sumadd(a, b, x, k * 2 + 1, l, (l + r) / 2);
			sumadd(a, b, x, k * 2 + 2, (l + r) / 2, r);
			sum[k] = sum[k * 2 + 1] + sum[k * 2 + 2];
		}
	}
	
	ll sumquery(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = n;
		eval(k, l, r);
		if (a >= r || b <= l) return 0;
		if (a <= l && r <= b) return sum[k];
		return sumquery(a, b, k * 2 + 1, l, (l + r) / 2) + sumquery(a, b, k * 2 + 2, (l + r) / 2, r);
	}
	
	void gcdadd(int k, ll x) {
		k += n - 1;
		node[k] += x;
		while (k) {
			k = (k - 1) / 2;
			node[k] = gcd(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	
	ll gcdquery(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = n;
		if (a >= r || b <= l) return 0;
		if (a <= l && r <= b) return abs(node[k]);
		return gcd(gcdquery(a, b, k * 2 + 1, l, (l + r) / 2), gcdquery(a, b, k * 2 + 2, (l + r) / 2, r));
	}
	
	void add(int a, int b, ll x) {
		sumadd(a, b, x);
		if (a > 0) gcdadd(a - 1, x);
		if (b > 0) gcdadd(b - 1, -x);
	}
	
	ll query(int a, int b) {
		return gcd(sumquery(a, a + 1), gcdquery(a, b - 1));
	}
};

int main() {
	int N, M;
	
	cin >> N;
	LazySegTree seg(N);
	REP(i, N) {
		int a; scanf("%d", &a);
		seg.add(i, i + 1, a);
	}
	
	cin >> M;
	REP(i, M) {
		int t, l, r;
		scanf("%d %d %d", &t, &l, &r);
		
		if (t == 0) printf("%lld\n", seg.query(l - 1, r));
		else seg.add(l - 1, r, t);
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:101:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int a; scanf("%d", &a);
                         ^
./Main.cpp:108:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &t, &l, &r);
                                ^

Judge Result