oj.uz

답안 #1067570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1067570 2024-08-20T20:28:50 Z Dennis_Jason Construction Project 2 (JOI24_ho_t2) C++14
8 / 100
 226 ms 24708 KB 
#include <bitset>
#include <cmath>
#include <functional>
#include <algorithm>
#include <numeric>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include <climits>
#define pb push_back
#define MOD 1000000007
#define NMAX 200001
#define nl '\n'
#define INF 1000000007
#define pii1 pair<int, pair<int,int>>  (1,(1,2));
#define pii pair<int,int>
#define tpl tuple<int,int,int,int,int>
#define int long long 
using namespace std;
ifstream fin("data.in");
ofstream fout("data.out");
/*
    ====================DEMONSTRATION======================



    =========================END===========================

 */
int n,m,s,t,l,k;
vector<int>v;
vector<vector<pii>>G(NMAX);
vector<int>dist_s,dist_t;
priority_queue<pii,vector<pii>,greater<pii>>pq;

void dijkstra(int node,vector<int>&dist)
{

    for(int i=0;i<n;++i)
        dist[i]=INF;
    dist[node]=0;
    pq.push({0,node});
    while(!pq.empty())
    {
        auto [dis,first]=pq.top();
        pq.pop();
        if(dist[first]<dis)
            continue;
        for(auto [u,w]:G[first])
        {
            if(dist[u]>dist[first]+w)
            {
                dist[u]=dist[first]+w;
                pq.push({dist[u],u});
            }
        }

    }
}
signed main() {

     cin>>n>>m;
     cin>>s>>t>>l>>k;
     s--;
     t--;
     dist_s.resize(n,INF);
     dist_t.resize(n,INF);
     for(int i=1;i<=m;++i)
     {
         int x,y,c;
         cin>>x>>y>>c;
         x--;
         y--;
         G[x].pb({y,c});
         G[y].pb({x,c});
     }

     dijkstra(s,dist_s);
     dijkstra(t,dist_t);
     if(dist_s[t]<=k)
     {
         cout<<(n*(n-1)/2);
         return 0;
     }

     sort(dist_t.begin(),dist_t.end());
     int ans=0;
     for(int i=0;i<n;++i)
     {
         int dis=k-l-dist_s[i];
         int pos= lower_bound(dist_t.begin(),dist_t.end(),dis+1)-dist_t.begin();
         ans+=pos;
     }
     cout<<ans;







    return 0;
}

Compilation message

Main.cpp: In function 'void dijkstra(long long int, std::vector<long long int>&)':
Main.cpp:57:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |         auto [dis,first]=pq.top();
      |              ^
Main.cpp:61:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   61 |         for(auto [u,w]:G[first])
      |                  ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 3 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 100 ms 18764 KB Output is correct
8 Correct 116 ms 18740 KB Output is correct
9 Correct 108 ms 18740 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 4 ms 5212 KB Output is correct
14 Correct 75 ms 13452 KB Output is correct
15 Correct 203 ms 19152 KB Output is correct
16 Correct 2 ms 4952 KB Output is correct
17 Correct 3 ms 5212 KB Output is correct
18 Correct 141 ms 17576 KB Output is correct
19 Correct 2 ms 5148 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 5 ms 5212 KB Output is correct
23 Correct 88 ms 13504 KB Output is correct
24 Correct 226 ms 19156 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 7 ms 5212 KB Output is correct
27 Correct 136 ms 24708 KB Output is correct
28 Correct 114 ms 17624 KB Output is correct
29 Correct 113 ms 15448 KB Output is correct

Subtask #2
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 3 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 3 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 3 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 100 ms 18764 KB Output is correct
8 Correct 116 ms 18740 KB Output is correct
9 Correct 108 ms 18740 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 5212 KB Output is correct
13 Correct 4 ms 5212 KB Output is correct
14 Correct 75 ms 13452 KB Output is correct
15 Correct 203 ms 19152 KB Output is correct
16 Correct 2 ms 4952 KB Output is correct
17 Correct 3 ms 5212 KB Output is correct
18 Correct 141 ms 17576 KB Output is correct
19 Correct 2 ms 5148 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 5 ms 5212 KB Output is correct
23 Correct 88 ms 13504 KB Output is correct
24 Correct 226 ms 19156 KB Output is correct
25 Correct 2 ms 4956 KB Output is correct
26 Correct 7 ms 5212 KB Output is correct
27 Correct 136 ms 24708 KB Output is correct
28 Correct 114 ms 17624 KB Output is correct
29 Correct 113 ms 15448 KB Output is correct
30 Correct 2 ms 4956 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 2 ms 4956 KB Output is correct
33 Incorrect 3 ms 4956 KB Output isn't correct
34 Halted 0 ms 0 KB -