제출 #1186970

#제출 시각아이디문제언어결과실행 시간메모리
1186970freshudoEaster Eggs (info1cup17_eastereggs)C++20
컴파일 에러
0 ms0 KiB
/* clang-format off */
#include <bits/stdc++.h>
#include <iostream>
using namespace std;

#define dbg(x) cout << #x << " = " << x << endl
#define printv(a) {for(auto u:a) cout<<u<<" "; cout<<endl;}
#define all(x) x.begin(), x.end()
#define sz(a) ((int)((a).size()))
#define int long long
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define lb(vect, x) (lower_bound(all(vect), x) - vect.begin())
#define ub(vect, x) (upper_bound(all(vect), x) - vect.begin())

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

bool prime(ll a) { if (a == 1) return 0; for (int i = 2; i*i <= a; i++) if (a % i == 0) return 0; return 1; }

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fll;
/* clang-format on */

int n;
vector<pii> distPorVertice;
vector<int> dist;
vector<vi> g;

void printarDistMenorQueX(int x)
{
    cout << x + 1 << " ";
    for (int i = 0; i <= x; i++)
    {
        cout << distPorVertice[i].s + 1 << " ";
    }

    cout << endl;
}

int recebeRespostaPositiva()
{
    int x;
    cin >> x;

    return x;
}

void DFS(int v)
{
    for (auto u : g[v])
    {
        if (dist[u] == -1)
        {
            dist[u] = dist[v] + 1;
            distPorVertice.pb({dist[u], u});

            DFS(u);
        }
    }
}

void solve()
{
    cin >> n;
    g.resize(n);
    dist.resize(n, -1);

    for (int i = 1; i < n; i++)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;
        g[a].pb(b);
        g[b].pb(a);
    }

    dist[0] = 0;
    distPorVertice.pb({0, 0});
    DFS(0);

    sort(all(distPorVertice));

    int l = 0, r = n - 1;
    while (l < r)
    {
        int m = (l + r) / 2;

        cout << "? ";
        printarDistMenorQueX(m);
        fflush(stdout);

        if (recebeRespostaPositiva())
        {
			r = m;
        }
        else
        {
            l = m + 1;
        }

        fflush(stdout);
    }

    cout << "! " << l +1 << endl;
}

int32_t main()
{
    // casas decimais
    // cout << fixed << setprecision(1);

    // horario
    // cout << setfill('0') << setw(2);

    int t = 1;

    for (int i = 1; i <= t; i++)
    {
        solve();

        // #ifdef ONPC
        //         cout << "__________________________" << endl;
        // #endif
    }

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

/usr/bin/ld: /tmp/ccpKv6vD.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccAlwudI.o:eastereggs.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccpKv6vD.o: in function `main':
grader.cpp:(.text.startup+0x1e7): undefined reference to `findEgg(int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >)'
collect2: error: ld returned 1 exit status