# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896896 | alexander707070 | Flights (JOI22_flights) | C++17 | 7 ms | 4656 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<bits/stdc++.h>
#include "Ali.h"
#define MAXN 100007
using namespace std;
namespace{
int n,xx,yy;
vector<int> v[MAXN],w;
int dist[MAXN];
string res;
bool vis[MAXN];
void dfs(int x,int p,int d){
dist[x]=d;
vis[x]=true;
for(int i=0;i<v[x].size();i++){
if(v[x][i]==p or vis[v[x][i]])continue;
dfs(v[x][i],x,d+1);
}
}
}
void Init(int N, vector<int> U, vector<int> V){
n=N;
for(int i=0;i<n;i++)v[i].clear();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |