oj.uz

답안 #742295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742295 2023-05-16T04:33:14 Z Abrar_Al_Samit Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 400 ms 464 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

const int nax = 513;

bool del[nax];
int sub[nax], par[nax];
vector<int>g[nax];

void dfs(int v, int p = 0) {
    par[v] = p;
    sub[v] = 1;
    for(int u : g[v]) if(u!=p) {
        if(del[u]) continue;

        dfs(u, v);
        sub[v] += sub[u];
    }
}
vector<int>stk;
void dfs2(int v, int p) {
    stk.push_back(v);
    for(int u : g[v]) if(u!=p) {
        if(del[u]) continue;
        dfs2(u, v);
    }
}
int findEgg (int N, vector<pair<int,int>>bridges) {
    memset(del, 0, sizeof del);
    for(int i=0; i<N-1; ++i) {
        auto [u, v] = bridges[i];
        g[u].push_back(v);
        g[v].push_back(u);
    }

    int cur_size = N;
    while(cur_size>1) {
        int best = 0, r, v;
        for(int i=1; i<=N; ++i) if(!del[i]) {
            dfs(i);

            for(int j=1; j<=N; ++j) if(!del[j]) {
                if(sub[j]<=cur_size/2 && best < sub[j]) {
                    best = sub[j];
                    r = i;
                    v = j;
                } 
            }
        }

        dfs(r);
        dfs2(v, par[v]);

        if(query(stk)) {
            for(int i=1; i<=N; ++i) {
                del[i] = 1;
            }
            cur_size = 0;
            for(int j : stk) {
                del[j] = 0;
                ++cur_size;
            }
        } else {
            for(int j : stk) {
                del[j] = 1;
                --cur_size;
            }
        }
        stk.clear();
    }

    for(int i=1; i<=N; ++i) if(!del[i]) {
        return i;
    }
    assert(0);
}

Compilation message

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:54:13: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
   54 |         dfs2(v, par[v]);
      |         ~~~~^~~~~~~~~~~
eastereggs.cpp:53:12: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   53 |         dfs(r);
      |         ~~~^~~

Subtask #1
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3046 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3055 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -