Submission #904653

#	Time	Username	Problem	Language	Result	Execution time	Memory
904653		marvinthang	Harvest (JOI20_harvest)	C++17	5 / 100	128 ms	1200 KiB

harvest

/*************************************
*    author: marvinthang             *
*    created: 12.01.2024 10:22:14    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int n, m, l, c; cin >> n >> m >> l >> c;
	vector <int> a(n), b(m); cin >> a >> b;
	int j = 1, k = 0;
	int div_c = c / l;
	int rem_c = c % l;
	vector <long long> w(n + m);
	vector <int> nxt(n);
	REP(i, n) {
		if (a[i] - a[0] < rem_c) {
			while (j + 1 < n && a[i] + l - a[j + 1] >= rem_c) ++j;
			nxt[i] = j;
			w[i] = div_c * l + a[i] + l - a[j];
		} else {
			while (k + 1 < n &&a[i] - a[k + 1] >= rem_c) ++k;
			nxt[i] = k;
			w[i] = div_c * l + a[i] - a[k];
		}
	}
	vector <vector <int>> adj(n);
	j = 0;
	REP(i, m) {
		if (b[i] < a[0]) {
			adj[n - 1].push_back(i + n);
			w[i + n] = b[i] + l - a[n - 1];
		} else {
			while (j + 1 < n && a[j + 1] < b[i]) ++j;
			adj[j].push_back(i + n);
			w[i + n] = b[i] - a[j];
		}
	}
	vector <bool> visited(n);
	vector <int> in_cycle(n, -1), root_cycle(n, -1);
	int cnt_cycles = 0;
	vector <long long> dist(n + m);
	vector <vector <long long>> List;
	vector <long long> sum, suff(n);
	REP(i, n) if (!visited[i]) {
		int u = i;
		while (!visited[u]) {
			visited[u] = true;
			u = nxt[u];
		}
		if (root_cycle[u] == -1) {
			root_cycle[u] = u;
			List.push_back({});
			int v = u;
			while (true) {
				in_cycle[v] = cnt_cycles;
				if (nxt[v] == u) break;
				adj[nxt[v]].push_back(v);
				v = nxt[v];
			}
			int t = u;
			suff[u] = w[v];
			root_cycle[v] = v;
			while (t != v) {
				root_cycle[t] = v;
				suff[nxt[t]] = suff[t] + w[t];
				t = nxt[t];
			}
			sum.push_back(suff[v]);
			++cnt_cycles;
		}
		int v = i;
		while (root_cycle[v] == -1) {
			adj[nxt[v]].push_back(v);
			root_cycle[v] = root_cycle[u];
			v = nxt[v];
		}
	}
	REP(i, n) if (root_cycle[i] == i) {
		function<void(int)> dfs = [&] (int u) {
			if (u >= n) {
				List[in_cycle[i]].push_back(dist[u]);
				return;
			}
			for (int v: adj[u]) {
				dist[v] = dist[u] + w[v];
				dfs(v);
			}
		};
		dfs(i);
	}
	int q; cin >> q;
	while (q--) {
		int r; long long t; cin >> r >> t; --r;
		long long res = 0;
		function<void(int)> dfs = [&] (int u) {
			if (u >= n) {
				if (dist[u] - dist[r] <= t) ++res;
				return;
			}
			for (int v: adj[u]) dfs(v);
		};
		dfs(r);
		int c = in_cycle[r];
		if (c != -1) {
			for (long long d: List[c]) {
				if (d > t) break;
				long long x = (t - d) / sum[c];
				long long y = (t - d) % sum[c];
				res += x;
				res += suff[r] <= y;
			}
		}
		cout << res << '\n';
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("harvest");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message (stderr)

harvest.cpp: In function 'int main()':
harvest.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
harvest.cpp:157:2: note: in expansion of macro 'file'
  157 |  file("harvest");
      |  ^~~~
harvest.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
harvest.cpp:157:2: note: in expansion of macro 'file'
  157 |  file("harvest");
      |  ^~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 75