# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14771 | progressive | Dreaming (IOI13_dreaming) | C++98 | 105 ms | 16244 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 <vector>
#include <algorithm>
using namespace std;
static const int MAXN=100100;
static vector<pair<int,int> > conn[MAXN];
static int color[MAXN];
static int tp=0;
static int hdist[MAXN];
static int dist[MAXN];
static int parent[MAXN];
static vector<int> samecolor[MAXN];
static vector<int> radius;
void colordfs(int a,int pa,int c)
{
color[a]=c;
samecolor[c].push_back(a);
for(int i=0;i<conn[a].size();i++)
{
int target=conn[a][i].first;
if(target==pa) continue;
hdist[target]=hdist[a]+conn[a][i].second;
colordfs(target,a,c);
}
}
void dfs(int a,int pa)
{
parent[a]=pa;
for(int i=0;i<conn[a].size();i++)
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... |