oj.uz

Submission #431679

# Submission time Handle Problem Language Result Execution time Memory
431679 2021-06-17T14:25:51 Z oolimry Harvest (JOI20_harvest) C++17
25 / 100
 5000 ms 181204 KB 
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define tern(cond, a, b) (cond ? a : b)
typedef long long lint;
typedef pair<int,int> ii;

lint n, m, L, T;
const int BUFF = 250000;
const int ROOT = 500000;

vector<lint> person;
lint apple[500005];
lint point[500005];
bool vis[500005];

lint getdis(int i){
	lint dis = person[i%BUFF] - person[point[i%BUFF]%BUFF];
	
	if(dis < T){
		dis += (T/L)*L;
	}
	while(dis < T) dis += L;
	return dis;
}

lint inf = 1e18 + 1e17;
map<lint,lint> infs;

vector<ii> adj[500005];
lint cyclesz[500005];
lint dis[500005];
lint low[500005];
lint high[500005];
lint maxval[500005];
lint total[500005];
lint rep[500005];

struct query{
	lint u, t, id, ans;
};
vector<query> queries;

vector<lint> stuff[500005];
lint toinf[500005];
lint sumreps[500005];
vector<lint> allreps;
vector<lint> mods[500005];

lint ppcnt = 0;
void dfs(lint u, int p = -1){
	low[u] = high[u] = ppcnt++;
	for(ii e : adj[u]){
		lint v = e.first, w = e.second;
		if(v == p) continue;
		dis[v] = dis[u] + w;
		
		if(u == ROOT){
			rep[v] = v;
			allreps.push_back(v);
		}
		else rep[v] = rep[u];
		
		dfs(v, u);
		high[u] = max(high[u], high[v]);
	}
}

void dfs2(lint u, int p = -1){
	for(ii e : adj[u]){
		lint v = e.first;
		if(v == p) continue;
		dfs2(v, u);
		maxval[u] = max(maxval[u], maxval[v]);
		total[u] += total[v];
	}
}

const int N = (1<<19);
vector<lint> tree[2*N];

inline void addshit(int u, lint t){
	t += dis[u];
	//show2(u, t);
	maxval[u] = max(maxval[u], t);
	stuff[rep[u]].push_back(t);
	total[u]++;
	for(int i = low[u] + N;i > 0;i >>= 1) tree[i].push_back(t);
}
inline void getready(){
	for(int i = 0;i < 2*N;i++) sort(all(tree[i]));
}
inline lint get(vector<lint> &v, lint t){
	return (lint)(upper_bound(all(v), t) - v.begin());
}
inline lint shitquery(int u, lint t){
	lint res = 0;
	for(int l = low[u]+N, r = high[u]+N+1;l < r;l >>= 1, r >>= 1){
		if(l&1) res += get(tree[l++], t);
		if(r&1) res += get(tree[--r], t);
	}
	return res;
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	memset(point, -1, sizeof(point));
	cin >> n >> m >> L >> T;
	
	person.resize(n);
	for(int i = 0;i < n;i++) cin >> person[i];
	for(int i = 0;i < m;i++) cin >> apple[i];
	
	for(int i = 0;i < n;i++){
		auto it = upper_bound(all(person), person[i] - (T%L));
		if(it == person.begin()) it = upper_bound(all(person), person[i] - (T%L) + L);
		
		it--;
		point[i] = it - person.begin();
		point[i+BUFF] = point[i]+BUFF;
	}
	
	for(int i = 0;i < n;i++){
		set<int> cur;
		int u = i;
		int cycle = -1;
		
		while(true){
			if(cur.find(u) != cur.end()) cycle = u;
			cur.insert(u);
			if(vis[u]) break;
			vis[u] = true;
			u = point[u];
		}
		
		if(cycle == -1) continue;
		
		
		lint totaldis = 0;
		u = cycle;
		vector<int> nodes;
		while(true){
			nodes.push_back(u);
			totaldis += getdis(u);
			u = point[u];
			if(u == cycle) break;
		}
		
		for(int x : nodes){
			cyclesz[x] = totaldis;
			cyclesz[x+BUFF] = totaldis;
		}
		
		point[cycle] += BUFF;
		point[cycle+BUFF] = ROOT;
	}
	
	
	for(int i = 0;i <= ROOT;i++){
		if(point[i] == -1) continue;
		
		
		if(point[i] == ROOT) adj[ROOT].push_back(ii(i, 0));
		else{
			lint dis = getdis(i);
			adj[point[i]].push_back(ii(i, dis));
			
		}
	}
	
	dfs(ROOT);
	
	for(int i = 0;i < m;i++){
		auto it = lower_bound(all(person), apple[i]);
		if(it == person.begin()) it = person.end();
		it--;
		int x = it - person.begin();
		
		
		lint t = apple[i] - person[x];
		if(t < 0) t += L;
		addshit(x, t);
	}
	
	getready();
	dfs2(ROOT);
	
	for(lint r : allreps){
		//show(r);
		for(lint x : stuff[r]){
			lint MM = cyclesz[r];
			lint I = inf;
			I /= MM;
			I *= MM;
			infs[MM] = I;
			
			lint hm = (I-x)/MM + 1;
			
			sumreps[r] += hm;
			//show(hm);
			mods[r].push_back(x%MM);
			
		}
		sort(all(mods[r]));
		sort(all(stuff[r]));
	}
	
	//show(inf);
	int Q; cin >> Q;
	for(int q = 0;q < Q;q++){
		lint u, t; cin >> u >> t;
		queries.push_back({u-1,t,q,0});
	}
	
	sort(all(queries), [&](query a, query b){
		if(rep[a.u] == rep[b.u]) return a.t < b.t;
		else return rep[a.u] < rep[b.u];
	});
	
	lint prevrep = -1;
	vector<lint> shitmods;
	lint sumofshit = 0;
	int ptr = 0;
	
	for(query &q : queries){
		lint u = q.u, t = q.t;
		lint ans = 0;
		
		if(rep[u] != prevrep){
			prevrep = rep[u];
			shitmods.clear();
			sumofshit = 0;
			ptr = 0;
		}

		ans += shitquery(u, t+dis[u]);
		
		if(cyclesz[u+BUFF] != 0){
			t += dis[u+BUFF];
			lint r = rep[u+BUFF];
			
			lint MM = cyclesz[r];
			//show2(t, t%MM);
			
			while(ptr < sz(stuff[r])){
				if(stuff[r][ptr] > t) break;
				else{
					sumofshit += (infs[MM]-stuff[r][ptr])/MM + 1;
					shitmods.push_back(stuff[r][ptr] % MM);
					ptr++;
				}
				sort(all(shitmods));
			}
			
			ans += sumofshit;
			lint fulls = (infs[MM]-(t+1))/MM;
			fulls *= sz(shitmods);
			
			if(fulls >= 0){
				ans -= fulls;
				ans -= (sz(shitmods) - (upper_bound(all(shitmods), t%MM) - shitmods.begin()));
			}
		}

		
		q.ans = ans;
	}
	
	sort(all(queries), [&](query a, query b){ return a.id < b.id; });
	for(query q : queries) cout << q.ans << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 64480 KB Output is correct
2 Correct 71 ms 65752 KB Output is correct
3 Correct 138 ms 65580 KB Output is correct
4 Correct 54 ms 65600 KB Output is correct
5 Correct 58 ms 66084 KB Output is correct
6 Correct 79 ms 66048 KB Output is correct
7 Correct 70 ms 66068 KB Output is correct
8 Correct 58 ms 65596 KB Output is correct
9 Correct 63 ms 65592 KB Output is correct
10 Correct 72 ms 65512 KB Output is correct
11 Correct 52 ms 65608 KB Output is correct
12 Correct 62 ms 66276 KB Output is correct
13 Correct 173 ms 66360 KB Output is correct
14 Correct 87 ms 66172 KB Output is correct
15 Correct 59 ms 65892 KB Output is correct
16 Correct 54 ms 65908 KB Output is correct
17 Correct 59 ms 65928 KB Output is correct
18 Correct 62 ms 65808 KB Output is correct
19 Correct 59 ms 65736 KB Output is correct
20 Correct 63 ms 65768 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 74812 KB Output is correct
2 Correct 583 ms 111664 KB Output is correct
3 Correct 319 ms 113764 KB Output is correct
4 Correct 402 ms 111056 KB Output is correct
5 Correct 577 ms 131408 KB Output is correct
6 Correct 531 ms 131000 KB Output is correct
7 Correct 317 ms 99636 KB Output is correct
8 Correct 428 ms 99660 KB Output is correct
9 Correct 688 ms 155052 KB Output is correct
10 Correct 513 ms 154612 KB Output is correct
11 Correct 1058 ms 153972 KB Output is correct
12 Correct 1012 ms 154096 KB Output is correct
13 Correct 1054 ms 154116 KB Output is correct
14 Correct 857 ms 153584 KB Output is correct
15 Correct 672 ms 136160 KB Output is correct
16 Correct 532 ms 121824 KB Output is correct
17 Correct 588 ms 121300 KB Output is correct
18 Correct 535 ms 86292 KB Output is correct
19 Correct 329 ms 86028 KB Output is correct
20 Correct 449 ms 110440 KB Output is correct

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 64480 KB Output is correct
2 Correct 71 ms 65752 KB Output is correct
3 Correct 138 ms 65580 KB Output is correct
4 Correct 54 ms 65600 KB Output is correct
5 Correct 58 ms 66084 KB Output is correct
6 Correct 79 ms 66048 KB Output is correct
7 Correct 70 ms 66068 KB Output is correct
8 Correct 58 ms 65596 KB Output is correct
9 Correct 63 ms 65592 KB Output is correct
10 Correct 72 ms 65512 KB Output is correct
11 Correct 52 ms 65608 KB Output is correct
12 Correct 62 ms 66276 KB Output is correct
13 Correct 173 ms 66360 KB Output is correct
14 Correct 87 ms 66172 KB Output is correct
15 Correct 59 ms 65892 KB Output is correct
16 Correct 54 ms 65908 KB Output is correct
17 Correct 59 ms 65928 KB Output is correct
18 Correct 62 ms 65808 KB Output is correct
19 Correct 59 ms 65736 KB Output is correct
20 Correct 63 ms 65768 KB Output is correct
21 Correct 319 ms 74812 KB Output is correct
22 Correct 583 ms 111664 KB Output is correct
23 Correct 319 ms 113764 KB Output is correct
24 Correct 402 ms 111056 KB Output is correct
25 Correct 577 ms 131408 KB Output is correct
26 Correct 531 ms 131000 KB Output is correct
27 Correct 317 ms 99636 KB Output is correct
28 Correct 428 ms 99660 KB Output is correct
29 Correct 688 ms 155052 KB Output is correct
30 Correct 513 ms 154612 KB Output is correct
31 Correct 1058 ms 153972 KB Output is correct
32 Correct 1012 ms 154096 KB Output is correct
33 Correct 1054 ms 154116 KB Output is correct
34 Correct 857 ms 153584 KB Output is correct
35 Correct 672 ms 136160 KB Output is correct
36 Correct 532 ms 121824 KB Output is correct
37 Correct 588 ms 121300 KB Output is correct
38 Correct 535 ms 86292 KB Output is correct
39 Correct 329 ms 86028 KB Output is correct
40 Correct 449 ms 110440 KB Output is correct
41 Correct 852 ms 161344 KB Output is correct
42 Correct 715 ms 167352 KB Output is correct
43 Correct 275 ms 107628 KB Output is correct
44 Correct 506 ms 154160 KB Output is correct
45 Correct 937 ms 181204 KB Output is correct
46 Correct 898 ms 179468 KB Output is correct
47 Correct 717 ms 180440 KB Output is correct
48 Correct 733 ms 169608 KB Output is correct
49 Correct 674 ms 173476 KB Output is correct
50 Correct 541 ms 149264 KB Output is correct
51 Execution timed out 5056 ms 148396 KB Time limit exceeded
52 Halted 0 ms 0 KB -