# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
266401 | Alexa2001 | Saveit (IOI10_saveit) | C++17 | 240 ms | 12016 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;
vector<vector<int>> v;
vector<int> t;
vector<bool> used;
int n;
void bfs(int node, vector<int> &dist)
{
dist.resize(n, 1e9);
dist[node] = 0;
queue<int> q;
q.push(node);
while(q.size())
{
int node = q.front();
q.pop();
for(auto it : v[node])
if(dist[node] + 1 < dist[it])
{
dist[it] = dist[node] + 1;
# | 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... |