# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
250978 | A02 | Dreaming (IOI13_dreaming) | C++14 | 522 ms | 29816 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 <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <set>
#include <map>
using namespace std;
pair<long long, long long> calc_centre(int start, vector<vector<pair<long long, long long> > > &adjacent){
queue<long long> to_visit;
to_visit.push(start);
map<long long, long long> distances1;
distances1[start] = 0;
long long longest_distance = 0;
long long endpoint = start;
while (!to_visit.empty()){
long long current = to_visit.front();
if (longest_distance < distances1[current]){
longest_distance = distances1[current];
endpoint = current;
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... |