Submission #1176650

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1176650	2025-03-31 15:14:01	HaciyevAlik	Easter Eggs (info1cup17_eastereggs)	C++20	100 / 100	8 ms	512 KiB

eastereggs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int mx=600;
vector<int> g[mx];
vector<int> top;
void dfs(int u,int p) {
    for(int v:g[u]) {
        if(v!=p) dfs(v,u);
    }
    top.push_back(u);
}
int findEgg(int N,vector<pair<int,int>> bridges){
    top.clear();
    for(int i=0;i<mx;++i) g[i].clear();
    for(int i=0;i<N-1;++i) {
        int u=bridges[i].first,v=bridges[i].second;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1,0);
    reverse(top.begin(),top.end());
    int l=1,r=N;
    while(l<r) {
        int mid=(l+r)/2;
        vector<int> temp;
        for(int i=1;i<=mid;++i) {
            temp.push_back(top[i-1]);
        }
        if(query(temp)) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 40 / 40
• Subtask 2: 40 / 40
• Subtask 3: 20 / 20