Submission #1194743

#	Time	Username	Problem	Language	Result	Execution time	Memory
1194743		shadow_sami	Fancy Fence (CEOI20_fancyfence)	C++20	0 / 100	0 ms	328 KiB

fancyfence

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifdef SAMI
	#define debug(x) cerr<<#x;cerr<<" ";_printn(x);cerr<<nli;
	#define debg() cerr<<nli;
#else
	#define debug(x)
	#define debg() 
#endif


void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[mx];
ll b[mx];
bool mark[mx];
vector<pi> v;

ll get(ll k){
	return ((k*(k+1))/2)%mod;
}

typedef struct disjoint_set_union{
	vi par,sz,dis;
	ll range,src,dest;	
	void init(ll k){
		range = k + 5;
		par.resize(range);
		dis.resize(range);
		sz.resize(range);
		fip(0,range){
			par[i] = i;
			sz[i] = 1;
			dis[i] = b[i];;
		}
		return;
	}
	ll find(ll k){
		return (par[k] == k ? k : par[k] = find(par[k]));
	}
	bool unite(ll u,ll v){
		src = find(u);
		dest = find(v);
		if(src==dest)
			return 0;
		if(sz[src] < sz[dest])swap(src,dest);
		par[dest] = src;
		sz[src] += sz[dest];
		dis[src] += dis[dest];
		return 1;
	}
}DSU;
DSU dsu;

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());	
    #ifdef SAMI
        freopen("input1.txt", "r", stdin);
        freopen("output1.txt", "w", stdout);
        freopen("error1.txt", "w", stderr);
    #endif // ONLINE_JUDGE

        cin>>n;        
        fip(1,n+1){
        	mark[i] = 0;
        	cin>>a[i];
        	v.push_back({-a[i],i});
        }
        fip(1,n+1)
        	cin>>b[i];
        dsu.init(n);
        srt(v);
        fip(0,n)
        	v[i].ff = -v[i].ff;
       	ll i = 0;
       	vi vv;       	
       	set<ll>st;
       	ans = 0;
       	while(i<n){
       		vv.clear();
       		vv.push_back(v[i].ss);
       		tp = a[v[i].ss]; 
       		mark[v[i].ss] = 1;
       		while(i+1<n && v[i+1].ff==v[i].ff){
       			i++;
       			vv.push_back(v[i].ss);
       			mark[v[i].ss] = 1;
       		}       		
       		st.clear();
       		      		       		
       		fx(vv){
       			if(mark[x+1])
       				dsu.unite(x,x+1);
       			if(mark[x-11])
       				dsu.unite(x,x+1);
       		}

       		fx(vv){       			
       			st.insert(dsu.find(x));
       		}
       		// fjp(1,n+1)
       		// 	cerr<<mark[j]<<" ";
       		// cerr<<nli;
       		// debug(st);
       		fx(st){
       			// debug(get(dsu.dis[x]));
       			res = get(dsu.dis[x]);
       			res = mod_mul(res,tp);
       			// debug(res);
       			ans += res;
       			ans %= mod;
       		}
       		i++;       		
       	}
       	cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 27