Submission #1035604

#	Time	Username	Problem	Language	Result	Execution time	Memory
1035604		RecursiveCo	Magic Show (APIO24_show)	C++17	Compilation error	0 ms	0 KiB

Alice

// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

//#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

/*long long setN(int n) {
    get(X);
    return X;
}*/

vector<pair<int, int>> Alice() {
    long long X = setN(5000);
    vector<pair<int, int>> res;
    forto(5000, i) {
        if (i == X - 1) continue;
        res.push_back({X - 1, i});
    }
    return res;
}

long long Bob(vector<pair<int, int>> edges) {
    vector<int> cnt(5000, 0);
    for (auto edge: edges) cnt[edge.first]++, cnt[edge.second]++;
    forto(5000, i) if (cnt[i] > 5) return i + 1;
}

signed main() {
    improvePerformance;
    //getTest;
    
    //eachTest {
        //out(Bob(Alice()));
    //}
}

Bob

Compilation message (stderr)

Alice.cpp: In function 'std::vector<std::pair<int, int> > Alice()':
Alice.cpp:77:19: error: 'setN' was not declared in this scope
   77 |     long long X = setN(5000);
      |                   ^~~~
Alice.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Alice.cpp:79:5: note: in expansion of macro 'forto'
   79 |     forto(5000, i) {
      |     ^~~~~
Alice.cpp: In function 'long long int Bob(std::vector<std::pair<int, int> >)':
Alice.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Alice.cpp:89:5: note: in expansion of macro 'forto'
   89 |     forto(5000, i) if (cnt[i] > 5) return i + 1;
      |     ^~~~~
Alice.cpp:87:28: warning: control reaches end of non-void function [-Wreturn-type]
   87 |     vector<int> cnt(5000, 0);
      |                            ^

/usr/bin/ld: /tmp/cctubgfk.o: in function `main':
grader_bob.cpp:(.text.startup+0x324): undefined reference to `Bob(std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >)'
collect2: error: ld returned 1 exit status