# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923249 | huutuan | Stray Cat (JOI20_stray) | C++14 | 41 ms | 17340 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 "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef sus
#define cerr if (0) cerr
#endif
const int N=2e4+10;
namespace sub1234{
vector<int> g[N];
vector<int> ans;
int dep[N];
void bfs(){
memset(dep, -1, sizeof dep);
queue<int> q;
q.push(0); dep[0]=0;
while (q.size()){
int u=q.front(); q.pop();
for (int v:g[u]){
if (dep[v]==-1){
dep[v]=dep[u]+1;
q.push(v);
}
}
}
}
vector<int> solve(int n, int m, vector<int> u, vector<int> v){
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |