Submission #1004279

---

Source Code Expand

#include <cstdio>
#include <cmath>

#include <algorithm>
#include <vector>
#include <utility>

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

template<typename T> void swap(T & x, T & y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T & a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T & a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

const int N =  200000;
const int S = 2000001;

int n, a[N], m, x[N];
int total, val[S], ans[S];


int id[S];
std::vector<int> vec[S];
void uf_init() {
	inc(i, total * 2) {
		id[i] = i;
		vec[i].push_back(i);
	}
}
int unite(int x, int y) {
	int vx = id[x], vy = id[y];
	if(vx == vy) { return vx; }
	
	if(vec[vx].size() < vec[vy].size()) { swap(vx, vy); }
	for(auto && e : vec[vy]) {
		id[e] = vx;
		vec[vx].push_back(e);
	}
	vec[vy].clear();
	
	return vx;
}

int main() {
	scanf("%d", &n);
	inc(i, n - 1) { scanf("%d", &a[i]); }
	scanf("%d", &m);
	inc(i, m) { scanf("%d", &x[i]); }
	
	incID(i, 2, n - 1) { total += a[i]; }
	
	uf_init();
	int sum = 0;
	decID(i, 2, n - 1) {
		sum += a[i];
		inc1(j, a[i]) {
			val[ unite(sum + j, sum - j) ] = sum + j;
		}
	}
	
	incII(i, 0, sum * 2) {
		for(auto && e : vec[i]) {
			ans[e] = val[i];
		}
	}
	
	inc(i, m) {
		printf("%d\n", (x[i] < sum ? ans[ x[i] ] : x[i]) - sum - a[1] + a[0]);
	}
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:64:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:65:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  inc(i, n - 1) { scanf("%d", &a[i]); }
                                    ^
./Main.cpp:66:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &m);
                 ^
./Main.cpp:67:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  inc(i, m) { scanf("%d", &x[i]); }
                                ^

Judge Result