Submission #762051

#	Time	Username	Problem	Language	Result	Execution time	Memory
762051		GrindMachine	Rigged Roads (NOI19_riggedroads)	C++17	58 / 100	2066 ms	67772 KiB

riggedroads

// 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<pii> adj[N];
vector<int> curr, path;
set<int> st[N];
vector<int> first(N,-1);
vector<int> enter[N];

void dfs(int u, int p){
    for(auto [v,id] : adj[u]){
        if(v == p) conts;
        dfs(v,u);

        if(!st[v].empty()){
            first[id] = *st[v].begin();
        }
    }

    int mx = -1, largest = -1;
    for(auto [v,id] : adj[u]){
        if(v == p) conts;
        if(sz(st[v]) > mx){
            mx = sz(st[v]);
            largest = v;
        }
    }

    if(largest != -1){
        swap(st[u], st[largest]);
        st[largest].clear();
    }

    for(auto [v,id] : adj[u]){
        if(v == p or v == largest) conts;
    
        trav(x,st[v]){
            if(st[u].count(x)){
                st[u].erase(x);
            }
            else{
                st[u].insert(x);
            }
        }

        st[v].clear();
    }

    trav(x,enter[u]){
        if(st[u].count(x)){
            st[u].erase(x);
        }
        else{
            st[u].insert(x);
        }
    }
}

void solve(int test_case)
{
    int n,m; cin >> n >> m;
    vector<pii> edges(m+5);

    rep1(i,m){
        int u,v; cin >> u >> v;
        edges[i] = {u,v};
    }

    vector<bool> in_mst(m+5);
    rep1(i,n-1){
        int id; cin >> id;
        in_mst[id] = 1;
        auto [u,v] = edges[id];
        adj[u].pb({v,id}), adj[v].pb({u,id});
    }

    rep1(i,m){
        if(!in_mst[i]){
            auto [u,v] = edges[i];
            enter[u].pb(i);
            enter[v].pb(i);
        }
    }

    dfs(1,-1);

    vector<int> here[m+5];
    rep1(i,m){
        if(first[i] != -1){
            here[first[i]].pb(i);
        }
    }

    vector<int> ans(m+5,-1);
    int ptr = 1;

    rep1(i,m){
        if(ans[i] != -1) conts;
        if(in_mst[i]){
            ans[i] = ptr++;
            conts;
        }

        auto ids = here[i];
        sort(all(ids));

        trav(id,ids){
            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;
}

Compilation message (stderr)

riggedroads.cpp: In function 'void dfs(int, int)':
riggedroads.cpp:81:22: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   81 |         if(sz(st[v]) > mx){
      |                      ^

• Subtask 1: 8 / 8
• Subtask 2: 19 / 19
• Subtask 3: 9 / 9
• Subtask 4: 0 / 10
• Subtask 5: 10 / 10
• Subtask 6: 12 / 12
• Subtask 7: 0 / 32