# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959814 | andrei_boaca | Stray Cat (JOI20_stray) | C++17 | 57 ms | 19936 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 <vector>
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
namespace
{
pii a={0,0},b={0,1},c={1,1};
vector<pii> vec={b,c,b,b,b,a};
map<pii,int> myind;
int INF=1e9;
vector<int> muchii[20005];
vector<pii> g;
int dist[20005];
int par[20005];
int n,m;
void bfs()
{
for(int i=0;i<n;i++)
dist[i]=INF;
dist[0]=0;
queue<int> coada;
coada.push(0);
while(!coada.empty())
{
int nod=coada.front();
coada.pop();
for(int i:muchii[nod])
if(dist[i]>dist[nod]+1)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |