# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15622 | gs14004 | Saveit (IOI10_saveit) | C++14 | 179 ms | 11624 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 <vector>
#include <queue>
#include <cstring>
using namespace std;
int dist[36][1005];
vector<int> graph[1005];
bool vis[1005];
int par[1005];
queue<int> q;
void bfs(int* dist, int st){
memset(vis,0,sizeof(vis));
q.push(st);
vis[st] = 1;
while(!q.empty()){
int qf = q.front();
q.pop();
for(auto &i : graph[qf]){
if(vis[i]) continue;
vis[i] = 1;
dist[i] = dist[qf] + 1;
par[i] = qf;
q.push(i);
}
}
}
# | 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... |