| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1308131 | packmani | 컴퓨터 네트워크 (BOI14_network) | C++20 | 51 ms | 4408 KiB |
#include "network.h"
#include<bits/stdc++.h>
using namespace std;
const int n = 2005;
int dist[n];
vector<int> ldist[n];
int d,e,temp;
vector<int> ans;
void findRoute (int N, int a, int b)
{
/*
* Obviously, this is not a good solution.
* Replace it with your own code.
*/
/*
int dist = ping(a, b);
for (int i = 1; i <= dist; ++i)
travelTo (i);
*/
for(int i=1;i<=N;i++)
{
if(i==a) continue;
dist[i] = ping(a,i);
ldist[dist[i]].push_back(i);
}
d = dist[b];
e=b;
//cout << d << '\n';
for(int i=1;i<=d;i++)
{
ans.push_back(e);
for(auto to : ldist[d-i])
{
temp = ping(to, e);
if(temp==0)
{
e=to;
break;
}
}
}
ans.push_back(e);
//cout << a << '\n';
for(int i=ans.size()-1;i>=0;i--)
{
//cout << ans[i] << '\n';
//cout << ans[i] << '\n';
travelTo(ans[i]);
}
}
/*
-------d--------
---------to-----
---------|--tmp-
*/
컴파일 시 표준 에러 (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... | ||||
