oj.uz

Submission #568733

# Submission time Handle Problem Language Result Execution time Memory
568733 2022-05-26T06:44:43 Z errorgorn Reconstruction Project (JOI22_reconstruction) C++17
42 / 100
 5000 ms 14500 KB 
#include <bits/stdc++.h>
using namespace std;

#define ii pair<int,int>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound

#define rep(x,s,e) for (int x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e))?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

struct UFDS{
	int p[505];
	int r[505];
	
	void reset(){ rep(x,0,505) p[x]=x,r[x]=0; }
	
	int par(int i){
		if (p[i]==i) return i;
		else return p[i]=par(p[i]);
	}
	
	bool unions(int i,int j){
		i=par(i),j=par(j);
		if (i==j) return false;
		
		if (r[i]>r[j]) swap(i,j);
		p[i]=j;
		if (r[i]==r[j]) r[j]++;
		
		return true;
	}
} ufds;

int n,m,q;
struct E{
	int u,v;
	int w;
};

E ee[100005];

int qu[1000005];
int split[1000005];
long long ans[1000005];

void solve(int l,int r,int optl,int optr,vector<int> vl,vector<int> vr){
	assert(sz(vl)+sz(vr)<=1000);
	
	int m=l+r>>1;
	
	//[optl,split[m]-1]
	//[split[m],optr]
	
	vector<int> tl=vl,tr=vr;
	vector<int> vl2,vr2;
	
	rep(x,optl,split[m]) tl.pub(x);
	rep(x,optr+1,split[m]) tr.pub(x);
	
	//cout<<"debug: "<<l<<" "<<m<<" "<<r<<" "<<optl<<" "<<optr<<endl;
	//for (auto it:tl) cout<<it<<" "; cout<<endl;
	//for (auto it:tr) cout<<it<<" "; cout<<endl;
	
	ufds.reset();
	while (sz(vl2)+sz(vr2)!=n-1){ //mst is not complete
		if (tr.empty() || 
			(!tl.empty() && qu[m]-ee[tl.back()].w<=ee[tr.back()].w-qu[m])){
			
			if (ufds.unions(ee[tl.back()].u,ee[tl.back()].v)){
				ans[m]+=qu[m]-ee[tl.back()].w;
				vl2.pub(tl.back());
			}
			tl.pob();
		}
		else{
			if (ufds.unions(ee[tr.back()].u,ee[tr.back()].v)){
				ans[m]+=ee[tr.back()].w-qu[m];
				vr2.pub(tr.back());
			}
			tr.pob();
		}
	}
	
	reverse(all(vl2));
	reverse(all(vr2));
	
	//for (auto it:vl2) cout<<it<<" "; cout<<endl;
	//for (auto it:vr2) cout<<it<<" "; cout<<endl;
	
	if (l!=m) solve(l,m-1,optl,split[m]-1,vl,vr2);
	if (m!=r) solve(m+1,r,split[m],optr,vl2,vr);
}

signed main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	cin>>n>>m;
	rep(x,0,m) cin>>ee[x].u>>ee[x].v>>ee[x].w;
	
	sort(ee,ee+m,[](E i,E j){
		return i.w<j.w;
	});
	
	cin>>q;
	rep(x,0,q) cin>>qu[x];
	
	split[0]=0;
	rep(x,0,q){
		while (split[x]<m && ee[split[x]].w<=qu[x]) split[x]++;
		split[x+1]=split[x];
	}
	
	//rep(x,0,m) cout<<x<<" "; cout<<endl;
	//rep(x,0,m) cout<<ee[x].u<<" "; cout<<endl;
	//rep(x,0,m) cout<<ee[x].v<<" "; cout<<endl;
	//rep(x,0,m) cout<<ee[x].w<<" "; cout<<endl;
	//cout<<endl;
	
	//rep(x,0,q) cout<<qu[x]<<" "; cout<<endl;
	//rep(x,0,q) cout<<split[x]<<" "; cout<<endl;
	
	solve(0,q-1,0,m-1,{},{});
	
	rep(x,0,q) cout<<ans[x]<<endl;
}

Compilation message

reconstruction.cpp: In function 'void solve(int, int, int, int, std::vector<int>, std::vector<int>)':
reconstruction.cpp:60:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |  int m=l+r>>1;
      |        ~^~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 35 ms 3192 KB Output is correct
21 Correct 38 ms 2760 KB Output is correct
22 Correct 35 ms 2768 KB Output is correct
23 Correct 41 ms 2800 KB Output is correct
24 Correct 34 ms 2736 KB Output is correct
25 Correct 39 ms 3108 KB Output is correct
26 Correct 36 ms 2632 KB Output is correct
27 Correct 32 ms 2772 KB Output is correct
28 Correct 31 ms 2724 KB Output is correct
29 Correct 28 ms 3016 KB Output is correct
30 Correct 33 ms 3028 KB Output is correct
31 Correct 34 ms 2712 KB Output is correct
32 Correct 38 ms 2808 KB Output is correct
33 Correct 32 ms 3280 KB Output is correct
34 Correct 30 ms 3552 KB Output is correct
35 Correct 32 ms 2968 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Execution timed out 5051 ms 14500 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Execution timed out 5039 ms 13796 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 35 ms 3192 KB Output is correct
21 Correct 38 ms 2760 KB Output is correct
22 Correct 35 ms 2768 KB Output is correct
23 Correct 41 ms 2800 KB Output is correct
24 Correct 34 ms 2736 KB Output is correct
25 Correct 39 ms 3108 KB Output is correct
26 Correct 36 ms 2632 KB Output is correct
27 Correct 32 ms 2772 KB Output is correct
28 Correct 31 ms 2724 KB Output is correct
29 Correct 28 ms 3016 KB Output is correct
30 Correct 33 ms 3028 KB Output is correct
31 Correct 34 ms 2712 KB Output is correct
32 Correct 38 ms 2808 KB Output is correct
33 Correct 32 ms 3280 KB Output is correct
34 Correct 30 ms 3552 KB Output is correct
35 Correct 32 ms 2968 KB Output is correct
36 Correct 417 ms 3096 KB Output is correct
37 Correct 377 ms 3272 KB Output is correct
38 Correct 400 ms 3036 KB Output is correct
39 Correct 417 ms 3024 KB Output is correct
40 Correct 394 ms 3136 KB Output is correct
41 Correct 431 ms 3216 KB Output is correct
42 Correct 397 ms 3020 KB Output is correct
43 Correct 397 ms 3084 KB Output is correct
44 Correct 299 ms 3120 KB Output is correct
45 Correct 199 ms 3476 KB Output is correct
46 Correct 395 ms 3120 KB Output is correct
47 Correct 400 ms 3004 KB Output is correct
48 Correct 382 ms 5260 KB Output is correct
49 Correct 378 ms 5956 KB Output is correct
50 Correct 194 ms 8244 KB Output is correct
51 Correct 205 ms 5556 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 35 ms 3192 KB Output is correct
21 Correct 38 ms 2760 KB Output is correct
22 Correct 35 ms 2768 KB Output is correct
23 Correct 41 ms 2800 KB Output is correct
24 Correct 34 ms 2736 KB Output is correct
25 Correct 39 ms 3108 KB Output is correct
26 Correct 36 ms 2632 KB Output is correct
27 Correct 32 ms 2772 KB Output is correct
28 Correct 31 ms 2724 KB Output is correct
29 Correct 28 ms 3016 KB Output is correct
30 Correct 33 ms 3028 KB Output is correct
31 Correct 34 ms 2712 KB Output is correct
32 Correct 38 ms 2808 KB Output is correct
33 Correct 32 ms 3280 KB Output is correct
34 Correct 30 ms 3552 KB Output is correct
35 Correct 32 ms 2968 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Execution timed out 5051 ms 14500 KB Time limit exceeded
40 Halted 0 ms 0 KB -