# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15891 | ggoh | Dreaming (IOI13_dreaming) | C++98 | 100 ms | 12328 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<cstdio>
#include<vector>
#include<algorithm>
struct AA{
int to,cost;
};
std::vector<AA>G[100002];
int ans,i,m,t,st[100002],dis[100002],pos,len,K;
bool v[2][100002];
void dfs(int x,int p)
{
for(int j=0;j<G[x].size();j++)
{
AA u=G[x][j];
if(!v[p][u.to])
{
dis[u.to]=dis[x]+u.cost;
if(m<=dis[u.to])
{
pos=u.to;m=dis[u.to];
}
v[p][u.to]=1;
dfs(u.to,p);
}
}
}
int travelTime(int N,int M,int L,int A[],int B[],int T[])
{
for(i=0;i<M;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... |