# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1172710 | SmuggingSpun | Construction Project 2 (JOI24_ho_t2) | C++20 | 111 ms | 5176 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
typedef long long ll;
const int lim = 2e5 + 5;
const ll INF = 1e18;
template<class T>void minimize(T& a, T b){
if(a > b){
a = b;
}
}
int n, m, s, t, L;
ll K;
namespace sub2{
void solve(){
vector<vector<ll>>d(n + 1, vector<ll>(n + 1, INF));
for(int i = 0; i < m; i++){
int u, v, w;
cin >> u >> v >> w;
d[u][v] = d[v][u] = w;
}
int ans = 0;
for(int i = 1; i < n; i++){
for(int j = n; j > i; j--){
vector<vector<ll>>_d = d;
minimize(_d[i][j], ll(L));
minimize(_d[j][i], ll(L));
for(int k = 1; k <= n; k++){
for(int u = 1; u <= n; u++){
for(int v = 1; v <= n; v++){
minimize(_d[u][v], _d[u][k] + _d[k][v]);
}
}
}
if(_d[s][t] <= K){
ans++;
}
}
}
cout << ans;
}
}
namespace sub134{
vector<pair<int, int>>g[lim];
void solve(){
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> m >> s >> t >> L >> K;
if(n <= 50 && m <= 50){
sub2::solve();
}
else{
sub134::solve();
}
}
컴파일 시 표준 에러 (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... |