Submission #347131

#	Time	Username	Problem	Language	Result	Execution time	Memory
347131		Pichon5	Putovanje (COCI20_putovanje)	C++17	0 / 110	362 ms	25700 KiB

putovanje

#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<<x<<endl;
//gcd(a,b)= ax + by
//lCB x&-x
//set.erase(it) - ersases the element present at the required index//auto it = s.find(element)
//set.find(element) - iterator pointing to the given element if it is present else return pointer pointing to set.end()
//set.lower_bound(element) - iterator pointing to element greater than or equal to the given element
//set.upper_bound(element) - iterator pointing to element greater than the given element
// | ^
using namespace std;
int n,a,b,c1,c2;
vector<vector<int> >G;
map<pair<int,int>,pair<int,int> >m;
vi v;
void dfs(int u, int padre){
    v.pb(u);
    for(auto it : G[u]){
        if(it==padre){
            continue;
        }
        dfs(it,u);
    }
}
int main()
{
    cin>>n;
    G.assign(n+1,vi());
    for(int i=0;i<n;i++){
        cin>>a>>b>>c1>>c2;
        G[a].pb(b);
        G[b].pb(a);
        m[{a,b}]={c1,c2};
        m[{b,a}]={c1,c2};
    }
    v.pb(0);
    for(int i=1;i<=n;i++){
        if(G[i].size()==1){
            dfs(i,0);
            break;
        }
    }
    vi pos(n+1);
    for(int i=1;i<=n;i++){
        pos[v[i]]=i;
    }
    vi dp(n+2,0);
    for(int i=2;i<=n;i++){
        int L=pos[i-1],R=pos[i];
        if(L>R)swap(L,R);
        dp[L]++;
        dp[R]--;
    }
    int sum=0;
    ll res=0;
    for(int i=1;i<n;i++){
        sum+=dp[i];
        //cout<<"paso de "<<v[i]<<"  a  "<<v[i+1]<<"  = "<<sum<<endl;
        //cout<<"precios   "<<m[{v[i],v[i+1]}].F<<" ^ "<<m[{v[i],v[i+1]}].S<<endl;
        if(m[{v[i],v[i+1]}].F*sum<m[{v[i],v[i+1]}].S){
            res+=m[{v[i],v[i+1]}].F*sum;
        }else{
            res+=m[{v[i],v[i+1]}].S;
        }
    }
    cout<<res<<endl;
    


    return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 25
• Subtask 3: 0 / 65