oj.uz

Submission #936211

# Submission time Handle Problem Language Result Execution time Memory
936211 2024-03-01T12:12:01 Z winter0101 Rigged Roads (NOI19_riggedroads) C++14
19 / 100
 267 ms 64696 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
const int maxn=3e5+9;
vector<pii>a[maxn];
int st[maxn][21],d[maxn];
pii pr[maxn];
void dfs(int u,int par){
for (auto v:a[u]){
if (v.fi==par)continue;
pr[v.fi]={u,v.se};
st[v.fi][0]=u;
for1(i,1,20)st[v.fi][i]=st[st[v.fi][i-1]][i-1];
d[v.fi]=d[u]+1;
dfs(v.fi,u);
}
}
pii b[maxn];
int lca(int u,int v){
if (d[u]<d[v])swap(u,v);
int k=d[u]-d[v];
for1(i,0,20)if (k>>i&1)u=st[u][i];
if (u==v)return u;
for2(i,20,0){
if (!st[u][i]||!st[v][i])continue;
if (st[u][i]!=st[v][i]){
u=st[u][i];
v=st[v][i];
}
}
return st[u][0];
}
bool use[maxn];
int ans[maxn];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    int n,m;
    cin>>n>>m;
    for1(i,1,m)cin>>b[i].fi>>b[i].se;
    for1(i,1,n-1){
    int id;
    cin>>id;
    use[id]=1;
    a[b[id].fi].pb({b[id].se,id});
    a[b[id].se].pb({b[id].fi,id});
    }
    dfs(1,0);
    vector<int>perm;
    auto take=[&](int id){
    int u=b[id].fi,v=b[id].se,t=lca(u,v),tu=u,tv=v;
    vector<int>xd;
    while (true){
    if (!tu)break;
    if (lca(tu,t)==tu)break;
    if (pr[tu].se)xd.pb(pr[tu].se);
    int lst=pr[tu].fi;
    pr[tu]={0,0};
    if (!lst)break;
    tu=lst;
    }
    pr[u]={tu,0};
    while (true){
    if (!tv)break;
    if (lca(tv,t)==tv)break;
    if (pr[tv].se)xd.pb(pr[tv].se);
    int lst=pr[tv].fi;
    pr[tv]={0,0};
    if (!lst)break;
    tv=lst;
    }
    pr[v]={tv,0};
    sort(all(xd));
    for (auto v:xd)perm.pb(v);
    if (!use[id])perm.pb(id);
    };
    for1(i,1,m){
    take(i);
    }
    int cnt=0;
    for (auto v:perm)ans[v]=++cnt;
    for1(i,1,m)cout<<ans[i]<<" ";
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 14936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 14936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 28868 KB Output is correct
2 Correct 98 ms 32848 KB Output is correct
3 Correct 89 ms 20668 KB Output is correct
4 Correct 168 ms 54964 KB Output is correct
5 Correct 226 ms 57012 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 97 ms 36324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 58044 KB Output is correct
2 Correct 242 ms 64280 KB Output is correct
3 Correct 52 ms 29808 KB Output is correct
4 Correct 74 ms 35060 KB Output is correct
5 Correct 267 ms 64696 KB Output is correct

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 182 ms 44544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 14936 KB Output isn't correct
2 Halted 0 ms 0 KB -