# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341763 | ogibogi2004 | Saveit (IOI10_saveit) | C++14 | 290 ms | 14940 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 "grader.h"
#include "encoder.h"
#include<bits/stdc++.h>
using namespace std;
string s;
int dist[40][1024];
vector<int>g[1024];
void bfs(int u)
{
queue<int>q;
q.push(u);
for(int i=0;i<1024;i++)
{
dist[u][i]=100000;
}
dist[u][u]=0;
while(!q.empty())
{
int u1=q.front();
q.pop();
for(auto v:g[u1])
{
if(dist[u][u1]+1<dist[u][v])
{
dist[u][v]=dist[u][u1]+1;
q.push(v);
}
}
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |