# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285010 | 3zp | Aesthetic (NOI20_aesthetic) | C++14 | 870 ms | 77148 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 500009;
vector<pair<ll, pair<ll, ll > > > v[N];
vector<ll> T[N];
ll d1[N],dn[N], f[N], g[N],ea[N],eb[N],ec[N], par[N],path[N],wh[N];
multiset<pair<ll,ll> > S;
void ad(ll x){
g[x] = 1;
for(auto E : v[x]){
ll y = E.first, l = E.second.first, u= E.second.second;
auto it= S.find({dn[y] + l + d1[x], u});
if(g[y] == 1) S.erase(it);
if(g[y] == 0) S.insert({dn[x] + l + d1[y], u});
}
}
ll A = 0;
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
for(ll i = 0; i < m; i++){
cin>>ea[i]>>eb[i]>>ec[i];
}
for(ll i = m-1; i >= 0; i--){
ll a = ea[i], b = eb[i], c = ec[i];
if(a == b) continue;
v[a].push_back({b, {c,A}});
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |