# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
554372 | andrei_boaca | Robot (JOI21_ho_t4) | C++17 | 163 ms | 18996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,dist[100005];
struct date
{
ll nod,cul,cost;
};
vector<date> muchii[100005];
bool bycul(date a, date b)
{
if(a.cul!=b.cul)
return a.cul<b.cul;
return a.cost<b.cost;
}
void bfs()
{
for(int i=1;i<=n;i++)
dist[i]=-1;
dist[1]=0;
queue<ll> coada;
coada.push(1);
while(!coada.empty())
{
ll nod=coada.front();
coada.pop();
for(auto j:muchii[nod])
{
ll node=j.nod;
Compilation message (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... |