답안 #472318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472318 2021-09-13T11:39:18 Z morasha3 Toll (BOI17_toll) C++17
0 / 100
74 ms 5120 KB
    #include<bits/stdc++.h>
    typedef long long ll;
    const ll mod = (ll) 1e9 + 7;
    const ll mx = (ll) 1e5 +7;
    using namespace std;
    vector<vector<pair<ll,ll>>>v(50007);
    ll k,n,q,m,ans=0;
     ll vis[50007];
    void dfs(ll idx,ll cnt,ll e)
    {
        vis[idx]=1;
        if(idx==e)
        {
            ans=min(cnt,ans);
            return;
        }
        for(int i=0;i<v[idx].size();i++)
        {
            if(vis[v[idx][i].first]==0)
                dfs(v[idx][i].first,cnt+v[idx][i].second,e);

        }
    }

    int main()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);

        cin>>k>>n>>m>>q;
     memset(vis,0,sizeof vis);
        for(int i=0;i<m;i++)
        {
            ll a,b,c;
            cin>>a>>b>>c;
            v[a].push_back({b,c});
        }
        for(int i=0;i<q;i++)
        {


            ll a,b;
            ans=INT_MAX;
            cin>>a>>b;
            dfs(a,0,b);
            if(ans==INT_MAX)ans=-1;
            cout<<ans<<endl;
        }
    }

Compilation message

toll.cpp: In function 'void dfs(ll, ll, ll)':
toll.cpp:17:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         for(int i=0;i<v[idx].size();i++)
      |                     ~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 44 ms 5120 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 74 ms 5088 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1868 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1868 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 44 ms 5120 KB Output isn't correct
2 Halted 0 ms 0 KB -