Can I participate in the mirror instead :)

baozii!!!

Please enable test data and detailed verdict: I still have no clues why my submission to E is incorrect (already made reasonable attempts of validating outputs).

Update: Thanks to communications from the problemsetters, my solution on E is incorrect because there is a (implied but not very clear) requirement of you cannot have well connected cycle of pipes but otherwise do not extract any oil. This gave a not-very-helpful message of "Unrecognized or misaligned character"

Why my code for problem k: Kanto To Johto, giving TLE

#pragma GCC optimize("O3", "inline")
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
#define pb push_back

struct Compare{
    bool operator()(const pair<int, int>& a, const pair<int, int>& b) const {
        return a.second < b.second;
    }
};

struct Compare1{
    bool operator()(const ll a, const ll b) const {
        return a > b;
    }
};
bool compare(const vector<int>& a, const vector<int>& b) {
    return a[1] < b[1];
}

ll solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> edges;
    vector<vector<pair<int, int>>> adj(n, vector<pair<int, int>>());
    for(int i = 0; i < m; i++) {
        int x, y, w;
        cin >> x >> y >> w;
        x--;
        y--;
        adj[x].pb({y, w});
        adj[y].pb({x, w});
        edges.pb({x, y, w});
    }
    priority_queue<pair<int, int>, vector<pair<int, int>>, Compare> pq1;
    vector<ll> distArr(n, LONG_LONG_MAX);
    distArr[0] = 0;
    pq1.push({0, 0});
    while(!pq1.empty()){
        pair<int, int> delPair = pq1.top();
        pq1.pop();
        for(pair<int, int> x: adj[delPair.first]) {
            if(distArr[delPair.first] + x.second < distArr[x.first]){
                distArr[x.first] = distArr[delPair.first] + x.second;
                pq1.push({x.first, distArr[x.first]});
            }
        }
    }
    ll ans1 = distArr[n - 1];
    
    vector<ll> myArr1(m, LONG_LONG_MAX);
    for(int i = 0; i < m; i++) {
        if(distArr[edges[i][0]] != LONG_LONG_MAX) myArr1[i] = edges[i][2];
    }

    sort(myArr1.begin(), myArr1.end());

    ll ans = 0;
    for(int i = 0; i < k; i++) {
        if(myArr1[i] == LONG_LONG_MAX) break;
        ans += myArr1[i];
    }
    return min(ans, ans1);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while(t--)
    {
        ll x = solve();
        cout << x << "\n";
    }
    return 0;
}