# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1828 | kriii | Dreaming (IOI13_dreaming) | C++98 | 103 ms | 8604 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 "dreaming.h"
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define max_N 100010
vector<pair<int, int> > Graph[max_N];
vector<int> Radius;
int Dist[max_N],Chk[max_N];
int FindEnd(int start, int chked)
{
queue<int> Q; int i,x,y,far,ind;
Q.push(start); Dist[start] = 0; Chk[start] = chked;
far = 0; ind = start;
while (!Q.empty()){
x = Q.front(); Q.pop();
for (i=0;i<Graph[x].size();i++){
y = Graph[x][i].first;
if (Chk[y] != chked){
Q.push(y); Dist[y] = Dist[x] + Graph[x][i].second; Chk[y] = chked;
if (far < Dist[y]){
far = Dist[y]; ind = y;
}
}
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |