제출 #492583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492583		PoPularPlusPlus	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	1 ms	460 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n , m , qu;
	cin >> n >> m >> qu;
	ll arr[n + 1];
	for(int i = 1; i <= n; i++)cin >> arr[i];
	vector<int> adj[n + 1];
	for(int i = 0; i < m; i++){
		int a , b;
		cin >> a >> b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	bool vis[n + 1];
	for(int i = 0; i < qu; i++){
		int u , v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
		queue<int> q;
		memset(vis,0,sizeof vis);
		vector<ll> f;
		for(int j = 1; j <= n; j++){
			if(!vis[j]){
				q.push(j);
				vis[j] = 1;
				ll sum = arr[j];
				while(q.size()){
					int node = q.front();
					q.pop();
					for(int k : adj[node]){
						if(!vis[k]){
							vis[k] = 1;
							sum += arr[k];
							q.push(k);
						}
					}
				}
				f.pb(sum);
			}
		}
		adj[u].pop_back();
		adj[v].pop_back();
		sv(f);
		reverse(all(f));
		ll ans = 0;
		for(ll j = 0; j < (int)f.size(); j++){
			ans += (j + 1LL) * f[j];
		}
		cout << ans << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29