| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 832727 | jlallas384 | Crocodile's Underground City (IOI11_crocodile) | C++17 | 0 ms | 308 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 "crocodile.h"
using namespace std;
using ll = long long;
struct edge{
int u, v, w;
int oth(int o){
return u ^ v ^ o;
}
};
int travel_plan(int n, int m, int r[][2], int L[], int k, int p[]){
vector<int> lst(n);
for(int i = 0; i < k; i++){
lst[p[i]] = 1;
}
vector<edge> edges;
vector<vector<int>> g(n);
vector<int> deg(n);
for(int i = 0; i < m; i++){
edges.push_back({r[i][0], r[i][1], L[i]});
g[r[i][0]].push_back(i);
g[r[i][1]].push_back(i);
deg[r[i][0]]++;
deg[r[i][1]]++;
}
vector<int> eban(m), ban(n, -1), proc(n);
queue<int> q;
for(int i = 1; i < n; i++) if(g[i].size() <= 2 && !lst[i]){
q.push(i);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||