Submission #1515718


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;
//---------------------------------//

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}

struct LazySegTree {
	vector<ll> node, lazy;
	int n;
	
	LazySegTree(int _n) {
		n = 1;
		while (n < _n) n *= 2;
		node.resize(n * 2 - 1, 0);
		lazy.resize(n * 2 - 1, 0);
	}
	
	void eval(int k, int l, int r) {
		if (lazy[k] == 0) return;
		node[k] += lazy[k];
		if (r - l > 1) {
			lazy[k * 2 + 1] += lazy[k];
			lazy[k * 2 + 2] += lazy[k];
		}
		lazy[k] = 0;
	}
	
	void add(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;
			eval(k, l, r);
		}
		else {
			add(a, b, x, k * 2 + 1, l, (l + r) / 2);
			add(a, b, x, k * 2 + 2, (l + r) / 2, r);
			node[k] = gcd(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	
	ll query(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 node[k];
		return gcd(query(a, b, k * 2 + 1, l, (l + r) / 2), query(a, b, k * 2 + 2, (l + r) / 2, r));
	}
};

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

Submission Time
Task D - ARCたんクッキー
User tkmst201
Language C++14 (GCC 5.4.1)
Score 30
Code Size 2031 Byte
Status WA
Exec Time 215 ms
Memory 5120 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:75: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:82: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

Set Name Subtask All
Score / Max Score 30 / 30 0 / 70
Status
AC × 18
AC × 21
WA × 13
Set Name Test Cases
Subtask 00_sample_01.txt, 00_sample_02.txt, 01_large_01.txt, 01_large_02.txt, 01_large_03.txt, 01_large_04.txt, 01_large_05.txt, 01_large_06.txt, 01_large_07.txt, 01_large_08.txt, 01_small_01.txt, 01_small_02.txt, 01_small_03.txt, 01_small_04.txt, 01_small_05.txt, 01_small_06.txt, 01_small_07.txt, 01_small_08.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_large_01.txt, 01_large_02.txt, 01_large_03.txt, 01_large_04.txt, 01_large_05.txt, 01_large_06.txt, 01_large_07.txt, 01_large_08.txt, 01_small_01.txt, 01_small_02.txt, 01_small_03.txt, 01_small_04.txt, 01_small_05.txt, 01_small_06.txt, 01_small_07.txt, 01_small_08.txt, 02_large_01.txt, 02_large_02.txt, 02_large_03.txt, 02_large_04.txt, 02_large_05.txt, 02_large_06.txt, 02_large_07.txt, 02_large_08.txt, 02_small_01.txt, 02_small_02.txt, 02_small_03.txt, 02_small_04.txt, 02_small_05.txt, 02_small_06.txt, 02_small_07.txt, 02_small_08.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
01_large_01.txt AC 111 ms 2432 KB
01_large_02.txt AC 135 ms 4480 KB
01_large_03.txt AC 111 ms 4992 KB
01_large_04.txt AC 134 ms 4736 KB
01_large_05.txt AC 146 ms 4480 KB
01_large_06.txt AC 164 ms 4480 KB
01_large_07.txt AC 161 ms 4480 KB
01_large_08.txt AC 150 ms 4480 KB
01_small_01.txt AC 1 ms 256 KB
01_small_02.txt AC 1 ms 256 KB
01_small_03.txt AC 1 ms 256 KB
01_small_04.txt AC 1 ms 256 KB
01_small_05.txt AC 2 ms 256 KB
01_small_06.txt AC 2 ms 256 KB
01_small_07.txt AC 3 ms 256 KB
01_small_08.txt AC 9 ms 512 KB
02_large_01.txt WA 142 ms 2560 KB
02_large_02.txt WA 162 ms 2560 KB
02_large_03.txt AC 37 ms 4352 KB
02_large_04.txt WA 214 ms 4480 KB
02_large_05.txt WA 215 ms 4608 KB
02_large_06.txt WA 208 ms 4480 KB
02_large_07.txt WA 166 ms 5120 KB
02_large_08.txt WA 170 ms 4480 KB
02_small_01.txt AC 1 ms 256 KB
02_small_02.txt WA 1 ms 256 KB
02_small_03.txt AC 1 ms 256 KB
02_small_04.txt WA 1 ms 256 KB
02_small_05.txt WA 2 ms 256 KB
02_small_06.txt WA 2 ms 256 KB
02_small_07.txt WA 2 ms 256 KB
02_small_08.txt WA 6 ms 256 KB