oj.uz

Submission #762042

# Submission time Handle Problem Language Result Execution time Memory
762042 2023-06-20T16:25:52 Z GrindMachine Rigged Roads (NOI19_riggedroads) C++17
49 / 100
 2000 ms 75540 KB 
// 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;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 4 ms 7364 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 4 ms 7364 KB Output is correct
4 Correct 5 ms 7508 KB Output is correct
5 Correct 6 ms 7500 KB Output is correct
6 Correct 9 ms 7508 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 15844 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2081 ms 31996 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 61952 KB Output is correct
2 Correct 211 ms 66164 KB Output is correct
3 Correct 44 ms 23960 KB Output is correct
4 Correct 69 ms 32432 KB Output is correct
5 Correct 247 ms 75540 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 33856 KB Output is correct
2 Correct 66 ms 27424 KB Output is correct
3 Correct 205 ms 49868 KB Output is correct
4 Correct 216 ms 43080 KB Output is correct
5 Correct 16 ms 10128 KB Output is correct

Subtask #7
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 4 ms 7364 KB Output is correct
4 Correct 5 ms 7508 KB Output is correct
5 Correct 6 ms 7500 KB Output is correct
6 Correct 9 ms 7508 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Execution timed out 2074 ms 15844 KB Time limit exceeded
10 Halted 0 ms 0 KB -