This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 3e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
vector<pll> adj[N];
vector<ll> curr, path;
void dfs(ll u, ll p, ll des){
if(u == des){
path = curr;
}
for(auto [v,id] : adj[u]){
if(v == p) conts;
curr.pb(id);
dfs(v,u,des);
curr.pop_back();
}
}
void solve(int test_case)
{
ll n,m; cin >> n >> m;
vector<pll> edges(m+5);
rep1(i,m){
ll u,v; cin >> u >> v;
edges[i] = {u,v};
}
vector<bool> in_mst(m+5);
rep1(i,n-1){
ll id; cin >> id;
in_mst[id] = 1;
auto [u,v] = edges[id];
adj[u].pb({v,id}), adj[v].pb({u,id});
}
vector<ll> ans(m+5,-1);
ll ptr = 1;
rep1(i,m){
if(ans[i] != -1) conts;
if(in_mst[i]){
ans[i] = ptr++;
conts;
}
auto [u,v] = edges[i];
curr.clear();
path.clear();
dfs(u,-1,v);
sort(all(path));
trav(id,path){
if(ans[id] != -1) conts;
ans[id] = ptr++;
}
ans[i] = ptr++;
}
rep1(i,m) cout << ans[i] << " ";
cout << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
# | 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... |