제출 #253838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
253838		aZvezda	Pipes (BOI13_pipes)	C++14	35 / 100	223 ms	21880 KiB

pipes

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
template<class T> inline void fix(T &x) {if(x >= mod | x <= -mod) {x %= mod;} if(x < 0) {x += mod;}}
#define out(x) cout << __LINE__ << ": " << (#x) << " = " << (x) << endl

const int MAX_N = 1e5 + 10;
set<pair<int, int> > g[MAX_N];
int ans[MAX_N], arr[MAX_N];

struct cmp {
    bool operator ()(const int &a, const int &b) const {
        if(g[a].size() == g[b].size()) {
            return a < b;
        }
        return g[a].size() < g[b].size();
    }
};

multiset<int, cmp> pq;

void removeBranches() {
    while(!pq.empty() && g[*(pq.begin())].size() == 1) {
        int curr = *(pq.begin()); pq.erase(pq.begin());
        auto other = *(g[curr].begin());
        ans[other.second] = arr[curr];
        arr[other.first] -= arr[curr];
        g[other.first].erase({curr, other.second});
    }
}

signed main() {
    //ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int n, m;
    cin >> n >> m;
    if(m > n) {cout << 0 << endl; return 0;}
    for(int i = 1; i <= n; i ++) {
        cin >> arr[i];
    }
    for(int i = 0; i < m; i ++) {
        int a, b;
        cin >> a >> b;
        g[a].insert({b, i});
        g[b].insert({a, i});
    }
    for(int i = 1; i <= n; i ++) {
        pq.insert(i);
    }
    removeBranches();
    for(int i = 0; i < m; i ++) {
        cout << ans[i] * 2 << endl;
    }
    return 0;
}

• Subtask 1: 0 / 30
• Subtask 2: 35 / 70