| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1126224 | psm9352 | 사이버랜드 (APIO23_cyberland) | C++20 | 18 ms | 2300 KiB |
#include <vector>
#include <algorithm>
using namespace std;
double solve(int N, int M, int K, int H, vector<int> x, vector<int>y, vector<int> c, vector<int> arr){
vector<double> ans(3,1e18);ans[0]=0;
for (int t = 0;t<4;t++){
for (int i = 0;i<M;i++){
if (ans[x[i]]!=1e18) ans[y[i]]=min(ans[y[i]],ans[x[i]]+c[i]);
if (ans[y[i]]!=1e18) ans[x[i]]=min(ans[x[i]],ans[y[i]]+c[i]);
}
}
if (ans[H]>=1e18){return -1;}
return ans[H];
}| # | 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... | ||||
| # | 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... | ||||
