# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
879666 | Giselus | Passport (JOI23_passport) | C++17 | 646 ms | 116752 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<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<deque>
#define S 262144
using namespace std;
vector<pair<int,int>> V[4*S];
bool vis[4*S][3];
int dist[4*S][3];
void BFS(int x, int t){
deque<pair<int,int>> q;
q.push_front({x,0});
while(!q.empty()){
int v = q.front().first;
int d = q.front().second;
q.pop_front();
if(vis[v][t])
continue;
vis[v][t] = 1;
dist[v][t] = d;
for(int i = 0; i < V[v].size(); i++){
int u = V[v][i].first;
int d2 = V[v][i].second;
if(d2 == 0){
q.push_front({u,d});
}else{
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... |