Wanna end this worst year with this good contest :)

HOPEFULLY!(

maksad?

Problem B – “Supremacy”!

cooked

All the best to every participants,

HOPE, I reach Expert today.

Hope for Cheaters free round

Expert after this one

first part you had done well ,

but for counting ans,

you have to only tackle val at odd positions and if b[i]>min(b[i-1],b[i+1]) then you have to decrease b[i] -> min(b[i+1],b[i-1]) — 1 as b[i] should be lesser than its neigh.

Edge cases -> position( 1 and n )-> where i-1 and i+1 take carefully.

that it for reference -> check My submission

I should have moved to D after C1 , D is easier compare to C2 .

C2 is good prob btw. got TLE at 5 :(.

It was all going fine until I read ‘You need to process Q queries’.

Be Ready for one INTERACTIVE Problem. there will be one.

Here is guide for Interactive Problems.

i got -15 , I don't know why? :(

All the best everyone! Hope everyone gets +ve delta.

As a participant,I don't know why my rating is droping :(.

Problems I’m guessing: A — Two Screens B — Binomial Coefficients, Kind Of C — New Game D — Attribute Checks E — Card Game F — Choose Your Queries G — Variable Damage

Dominater069 Early congratulations to you on becoming the first and only LGM from India.

Sending early congratulations on being the very first Legendary Grandmaster from India.

Hope this round push me to blue :).

here , you have to arrange edges according to ( x , y) if (x>y) then v -> u otherwise u -> v .

and then traverse according to indegree if indegree is zero then that particular node doesn't have to take tension of any node so assign maxm remaing val to this position .

1->2 -> 3 | | 4 5
here 3,4,5 have indegree 0 so we can put any value at this positions according to their parent and (x,y) . decrese indegree at also after processing nodes . finally you will have your ans . // this is text

//this is code
void solve() {
    ll n;
    cin>>n;
    vector<vi> graph(n+1);
    vector<int> in(n+1, 0);
    for (int i = 0; i < n-1; i++) {
        int u, v, x, y;
        cin >>u>>v>>x>>y;
        if (x >= y) {
            graph[u].push_back(v);
            in[v]++;
        } else {
            graph[v].push_back(u);
            in[u]++;
        }
    }
    
    queue<int> q;
    for (int i = 1; i <= n; i++) {
        if (in[i] == 0) {
            q.push(i);
        }
    }
    
    vector<int> res(n+1);
    int current = n;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        res[u] = current;
        current--;
        for (int v : graph[u]) {
            in[v]--;
            if (in[v] == 0) {
                q.push(v);
            }
        }
    }
    
    for (int i = 1; i <= n; i++) {
        cout<<res[i]<< " ";
    }
    cout << endl;
}

Good contest Overall , Don't know why I stucked on B for long although it was so easy after it clicked , C was simple topo qeustion , D was good literally took so much time .

Hope getting blue in next contest.

If I don’t get a green tick in under 2 minutes on A, I’m retiring.

Can anyone please explain about Kotlin Heroes round , as I am unaware about that rounds please .

Thanks

Please no Error in statements in questions , please check ,recheck and recheck again . Thanks

After seeing your account, I found that you are solving 800 rated problems too much , you should solve 1100 — 1300 problems now to reach pupil .

solve problems around your rating to see changes ( Tried and Tested Method )

Ready for (=^･ω･^=) meow meow problems for this contest :)

good at cf :) ?

Hopefully , if you solve 4 problem under an hour and total 5 .:)

Approaching Blue :) Hope by next contest

IIT Indore has done so well . #61

Problem Statement is confusing but soln below is too good to understand .

Why it's taking too much time to show rating??