Submission #795662

#	Time	Username	Problem	Language	Result	Execution time	Memory
795662		Antekb	Reconstruction Project (JOI22_reconstruction)	C++17	100 / 100	1102 ms	50048 KiB

reconstruction

#include<bits/stdc++.h>

#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
//#define deb(x...) ;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int K=17, N=1<<K, INF=1e9+5, mod2=1e9+7, mod=998244353;

struct modint{
	int n=0;
	modint(){}
	modint(ll x){
		n=x%mod;
		if(n<0)n+=mod;
	}
	operator int(){
		return n;
	}
	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
	modint operator+=(modint a){return (*this)=(*this)+a;}
	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
	modint operator-=(modint a){return (*this)=(*this)-a;}
	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
	modint operator*=(modint a){return (*this)=(*this)*a;}
	modint operator^(const ll &m)const{
		modint a(1);
		if(m==0)return a;
		if(m==1)return (*this);
		a=(*this)^(m/2);
		a*=a;
		return a*((*this)^(m&1));
	}
	modint odw(){
		return (*this)^((ll)mod-2);
	}
	modint operator/(modint a){return (*this)*a.odw();}
	modint operator/=(modint a){return (*this)=(*this)/a;}
	bool operator==(modint a){return a.n==n;}
	friend ostream& operator<<(ostream& os, modint m) {
		return os << m.n; 
	}
};
/*modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
    fact[0]=1;
    for(int i=1; i<N; i++){
        fact[i]=(fact[i-1]*modint(i))%mod;
    }
    fact2[N-1]=fact[N-1].odw();
    for(int i=N-2; i>=0; i--){
    	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
    }
}
modint npok(int _n, int _k){
 	if(_n<_k)return 0;
    return fact[_n]*fact2[_k]*fact2[_n-_k];
}*/
int los(int a, int b){
	return a+(rng())%(b-a+1);
}
int r[N];
int find(int v){
	if(v==r[v])return v;
	return r[v]=find(r[v]);
}
void Union(int u, int v){
	r[find(u)]=find(v);
}
int main(){
	//factinit();
	//BOOST
	int n, m, q;
	cin>>n>>m;
	vector<pair<int, pii> > edg(m);
	vi pocz(m, 1e9+5), kon(m, 1e9+5);
	for(int i=0; i<m; i++){
		int u, v, w;
		cin>>u>>v>>w;
		edg[i]=mp(w, mp(u, v));
	}
	sor(edg);
	for(int i=1; i<=n; i++)r[i]=i;
	vi akt;
	for(int i=0; i<m; i++){
		int u=edg[i].nd.st, v=edg[i].nd.nd;
		u=find(u);
		v=find(v);
		if(u!=v){
			r[u]=v;
			pocz[i]=0;
			akt.pb(i);
		}
	}
	//deb(akt)
	for(int i=0; i<m; i++){
		if(pocz[i]==1e9+5){
			for(int j=1; j<=n; j++)r[j]=j;
			vi akt2;
			bool b=1;
			//deb(edg[i]);
			for(int e=n-2; e>=0; e--){
				if(b&&akt[e]<i){
					//deb("a");
					Union(edg[i].nd.st, edg[i].nd.nd);
					akt2.pb(i);
				 	b=0;
				}
				int u=find(edg[akt[e]].nd.st), v=find(edg[akt[e]].nd.nd);
				//deb(u, v);
				if(u!=v){
					r[u]=v;
					akt2.pb(akt[e]);
				}
				else kon[akt[e]]=pocz[i]=(edg[akt[e]].st+edg[i].st+1)/2;
			}
			rev(akt2);
			akt=akt2;
			//deb(akt);
		}
	}
	for(int i:akt)kon[i]=1e9+5;
	vector<pair<int, pii> > V;
	for(int i=0; i<m; i++){
		//deb(edg[i], pocz[i], kon[i]);
		V.eb(pocz[i], mp(-1, edg[i].st));
		V.eb(edg[i].st, mp(2, -2*edg[i].st));
		V.eb(kon[i], mp(-1, edg[i].st));
	}
	cin>>q;
	vii Q;
	for(int i=0; i<q; i++){
		int x;
		cin>>x;
		Q.eb(x, i);
	}
	vector<ll> ans(q);
	sor(Q);
	sor(V);
	ll A=0, B=0;
	int wsk=0;
	for(int i=0; i<=V.size(); i++){
		while(wsk<q && (i==V.size() || Q[wsk].st<V[i].st)){
			ans[Q[wsk].nd]=A*Q[wsk].st+B;
			//deb(Q[wsk], ans[Q[wsk].nd]);
			wsk++;
		}
		if(i<V.size()){
			//deb(V[i]);
			A+=V[i].nd.st;
			B+=V[i].nd.nd;
		}
	}
	for(int i=0; i<q; i++){
		cout<<ans[i]<<"\n";
	}
}

Compilation message (stderr)

reconstruction.cpp: In function 'int main()':
reconstruction.cpp:201:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  201 |  for(int i=0; i<=V.size(); i++){
      |               ~^~~~~~~~~~
reconstruction.cpp:202:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  202 |   while(wsk<q && (i==V.size() || Q[wsk].st<V[i].st)){
      |                   ~^~~~~~~~~~
reconstruction.cpp:207:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  207 |   if(i<V.size()){
      |      ~^~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 7 / 7
• Subtask 4: 28 / 28
• Subtask 5: 35 / 35
• Subtask 6: 23 / 23