Submission #834112

#	Time	Username	Problem	Language	Result	Execution time	Memory
834112		Liudas	Aesthetic (NOI20_aesthetic)	C++17	13 / 100	2063 ms	39316 KiB

Aesthetic

#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#define int long long
using namespace std;
signed main(){
    int N, M;
    cin >> N >> M;
    vector<vector<pair<int, int>>> tree(N);
    vector<int> vals(M);
    for(int i = 0; i < M; i ++){
        int a, b, c;
        cin >> a >> b >> c;
        a--;
        b--;
        tree[a].push_back({b,i});
        tree[b].push_back({a,i});
        vals[i] = c;
    }
    int an = 0;
    for(int i = 0; i < M-1; i ++){
        int tval = *max_element(vals.begin()+i+1, vals.end());
        vals[i] += tval;
        priority_queue<vector<int>> que;
        que.push({0,0});
        int ans = 0;
        vector<bool> vis(N);
        while(!que.empty()){
            int a = -que.top()[0], b = que.top()[1];
            que.pop();
            if(b == N-1){ans = a; break;}
            if(vis[b])continue;
            vis[b] = true;
            for(auto [l, r] : tree[b]){
                que.push({-a-vals[r], l});
            }
        }
        an = max(an, ans);
        vals[i] -= tval;
    }
    cout << an << endl;
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 0 / 7
• Subtask 4: 0 / 15
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22
• Subtask 7: 0 / 27