Submission #783823

#	Time	Username	Problem	Language	Result	Execution time	Memory
783823		ZHIRDILBILDIZ	Cyberland (APIO23_cyberland)	C++17	0 / 100	380 ms	9000 KiB

cyberland

#include<bits/stdc++.h>
#include"cyberland.h"
#define ll long long
#define fi first
#define se second
using namespace std ;
const int N = 1e5 ;
bitset<N> us ;
ll dist[N] ;
vector<pair<int, ll>> v[N] ;
ll deikstra_for_one(int start, int abu)
{
    for(int i = 0 ; i < N ; i++)
        dist[i] = 1e18 ;
    set<pair<ll, int>> s ;
    dist[start] = 0 ;
    s.insert({0, start}) ;
    while(s.size())
    {
        pair<ll, int> p = *s.begin() ;
        s.erase(s.begin()) ;
        if(us[p.se])
            continue ;
        us[p.se] = 1 ;
        for(auto i : v[p.se])
        {
            if(us[i.fi] || dist[i.fi] <= dist[p.se] + i.se)
                continue ;
            dist[i.fi] = dist[p.se] + i.se ;
            s.insert({dist[i.fi], i.fi}) ;
        }
    }
    return dist[abu] ;
}
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> arr)
{
    bool flag1 = 0 ;
    for(int i = 0 ; i < n ; i++)
        if(arr[i] != 1)flag1 = 1 ;
    for(int i = 0 ; i < m ; i++)
    {
        v[x[i]].push_back({y[i], c[i]}) ;
        v[y[i]].push_back({x[i], c[i]}) ;
    }
    if(!flag1)
        return deikstra_for_one(1, h) ;
}
//signed main()
//{
//    ios_base::sync_with_stdio( 0 ) ;
//    cin.tie( 0 ) ;
//    cout.tie( 0 ) ;
//    int n, m, k, h ;
//    cin >> n >> m >> k >> h ;
//    vector<int> a(m), b(m), c(m), arr(n) ;
//    for(int i = 0 ; i < n ; i++)
//        cin >> arr[i] ;
//    for(int i = 0 ; i < m ; i++)
//        cin >> a[i] >> b[i] >> c[i] ;
//    cout << solve(n, m, k, h, x, y, c, arr) ;
//    return 0 ;
//}

Compilation message (stderr)

cyberland.cpp: In function 'double solve(int, int, int, int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
cyberland.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3