oj.uz

Submission #904694

# Submission time Handle Problem Language Result Execution time Memory
904694 2024-01-12T07:32:55 Z marvinthang Harvest (JOI20_harvest) C++17
100 / 100
 357 ms 76364 KB 
/*************************************
*    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 << '}'; }

// index from 0
template <class T> struct Fenwick {
    int n; vector <T> bit;
    Fenwick(int _n = 0): n(_n), bit(n + 1, 0) {}
    void reset(void) { fill(bit.begin(), bit.end(), 0); }
    void resize(int _n) { bit.assign(_n + 1, 0); }
    void update(int i, T val) { for (++i; i <= n; i += i & -i) bit[i] += val; }
    T get(int i) {
        if (i < 0) return 0;
        T res(0);
        for (i = min(i + 1, n); i > 0; i &= i - 1) res += bit[i];
        return res;
    }
    int upper_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i) 
            if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
    int lower_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i)
            if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
};

// 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 = 0, 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 <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;
			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];
		}
	}
	vector <int> tin(n + m), tout(n);
	int t = -1;
	vector <vector <long long>> List(cnt_cycles), pref(cnt_cycles);
	REP(i, n) if (root_cycle[i] == i) {
		int c = in_cycle[i];
		function<void(int)> dfs = [&] (int u) {
			tin[u] = ++t;
			if (u >= n) {
				List[c].push_back(dist[u]);
				return;
			}
			for (int v: adj[u]) {
				dist[v] = dist[u] + w[v];
				dfs(v);
			}
			tout[u] = t;
		};
		dfs(i);
		sort(ALL(List[c]));
		pref[c].push_back(0);
		for (auto x: List[c]) pref[c].push_back(pref[c].back() + x / sum[c]);
	}
	int q; cin >> q;
	vector <long long> res(q);
	vector <pair <long long, int>> queries;
	vector <vector <tuple <long long, int, int>>> queries_rem(cnt_cycles);
	vector <long long> V(q), T(q);
	REP(i, q) {
		cin >> V[i] >> T[i]; --V[i];		
		queries.emplace_back(T[i] + dist[V[i]], i);
		int c = in_cycle[V[i]];
		if (c != -1) {
			T[i] -= suff[V[i]];
			int p = upper_bound(ALL(List[c]), T[i]) - List[c].begin();
			res[i] += T[i] / sum[c] * p - pref[c][p];
			queries_rem[c].emplace_back(T[i] % sum[c], p, i);
		}
	}
	sort(ALL(queries));
	vector <int> order(m);
	iota(ALL(order), n);
	sort(ALL(order), [&] (int x, int y) { return dist[x] < dist[y]; });
	Fenwick <int> bit(n + m);
	j = 0;
	for (auto [t, i]: queries) {
		while (j < m && dist[order[j]] <= t) bit.update(tin[order[j++]], +1);
		res[i] += bit.get(tout[V[i]]) - bit.get(tin[V[i]] - 1);
	}
	REP(c, cnt_cycles) {
		Fenwick <int> bit(List[c].size());
		sort(ALL(queries_rem[c]));
		vector <pair <long long, int>> values;
		REP(i, List[c].size()) values.emplace_back(List[c][i] % sum[c], i);
		sort(ALL(values));
		j = 0;
		for (auto [t, p, i]: queries_rem[c]) {
			while (j < (int) values.size() && values[j].fi <= t) bit.update(values[j++].se, 1);
			res[i] += bit.get(p - 1);
		}
	}
	REP(i, q) cout << res[i] << '\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

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:206:2: note: in expansion of macro 'file'
  206 |  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:206:2: note: in expansion of macro 'file'
  206 |  file("harvest");
      |  ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 5 ms 1624 KB Output is correct
3 Correct 3 ms 1368 KB Output is correct
4 Correct 4 ms 1112 KB Output is correct
5 Correct 3 ms 1368 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 3 ms 1372 KB Output is correct
8 Correct 3 ms 1116 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 3 ms 1112 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 4 ms 1116 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 4 ms 1116 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 3 ms 1312 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 15784 KB Output is correct
2 Correct 150 ms 35000 KB Output is correct
3 Correct 283 ms 58172 KB Output is correct
4 Correct 154 ms 62664 KB Output is correct
5 Correct 146 ms 53232 KB Output is correct
6 Correct 141 ms 54032 KB Output is correct
7 Correct 119 ms 32228 KB Output is correct
8 Correct 154 ms 32352 KB Output is correct
9 Correct 209 ms 58520 KB Output is correct
10 Correct 156 ms 57960 KB Output is correct
11 Correct 242 ms 57744 KB Output is correct
12 Correct 200 ms 57484 KB Output is correct
13 Correct 216 ms 57516 KB Output is correct
14 Correct 197 ms 57436 KB Output is correct
15 Correct 169 ms 51636 KB Output is correct
16 Correct 130 ms 45268 KB Output is correct
17 Correct 129 ms 45020 KB Output is correct
18 Correct 93 ms 21988 KB Output is correct
19 Correct 101 ms 21256 KB Output is correct
20 Correct 111 ms 33980 KB Output is correct

Subtask #3
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 5 ms 1624 KB Output is correct
3 Correct 3 ms 1368 KB Output is correct
4 Correct 4 ms 1112 KB Output is correct
5 Correct 3 ms 1368 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 3 ms 1372 KB Output is correct
8 Correct 3 ms 1116 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 3 ms 1112 KB Output is correct
12 Correct 3 ms 1372 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 4 ms 1116 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 3 ms 1112 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 4 ms 1116 KB Output is correct
19 Correct 3 ms 1112 KB Output is correct
20 Correct 3 ms 1312 KB Output is correct
21 Correct 99 ms 15784 KB Output is correct
22 Correct 150 ms 35000 KB Output is correct
23 Correct 283 ms 58172 KB Output is correct
24 Correct 154 ms 62664 KB Output is correct
25 Correct 146 ms 53232 KB Output is correct
26 Correct 141 ms 54032 KB Output is correct
27 Correct 119 ms 32228 KB Output is correct
28 Correct 154 ms 32352 KB Output is correct
29 Correct 209 ms 58520 KB Output is correct
30 Correct 156 ms 57960 KB Output is correct
31 Correct 242 ms 57744 KB Output is correct
32 Correct 200 ms 57484 KB Output is correct
33 Correct 216 ms 57516 KB Output is correct
34 Correct 197 ms 57436 KB Output is correct
35 Correct 169 ms 51636 KB Output is correct
36 Correct 130 ms 45268 KB Output is correct
37 Correct 129 ms 45020 KB Output is correct
38 Correct 93 ms 21988 KB Output is correct
39 Correct 101 ms 21256 KB Output is correct
40 Correct 111 ms 33980 KB Output is correct
41 Correct 226 ms 54256 KB Output is correct
42 Correct 357 ms 71436 KB Output is correct
43 Correct 141 ms 57528 KB Output is correct
44 Correct 181 ms 76364 KB Output is correct
45 Correct 172 ms 68432 KB Output is correct
46 Correct 180 ms 71500 KB Output is correct
47 Correct 189 ms 70416 KB Output is correct
48 Correct 193 ms 73404 KB Output is correct
49 Correct 178 ms 71844 KB Output is correct
50 Correct 182 ms 51644 KB Output is correct
51 Correct 157 ms 51508 KB Output is correct
52 Correct 230 ms 73420 KB Output is correct
53 Correct 236 ms 73860 KB Output is correct
54 Correct 275 ms 72016 KB Output is correct
55 Correct 304 ms 72000 KB Output is correct
56 Correct 200 ms 62396 KB Output is correct
57 Correct 191 ms 61924 KB Output is correct
58 Correct 212 ms 63752 KB Output is correct
59 Correct 179 ms 63440 KB Output is correct
60 Correct 191 ms 63560 KB Output is correct
61 Correct 187 ms 65732 KB Output is correct
62 Correct 234 ms 65152 KB Output is correct
63 Correct 128 ms 38312 KB Output is correct
64 Correct 140 ms 38292 KB Output is correct
65 Correct 130 ms 38516 KB Output is correct
66 Correct 161 ms 38336 KB Output is correct
67 Correct 139 ms 38848 KB Output is correct
68 Correct 150 ms 38020 KB Output is correct
69 Correct 205 ms 53344 KB Output is correct
70 Correct 223 ms 51432 KB Output is correct
71 Correct 191 ms 51904 KB Output is correct
72 Correct 228 ms 51396 KB Output is correct