oj.uz

Submission #1035613

# Submission time Handle Problem Language Result Execution time Memory
1035613 2024-07-26T12:29:44 Z RecursiveCo Magic Show (APIO24_show) C++17
5 / 100
 2 ms 1080 KB 
// CF template, version 3.0

#include <bits/stdc++.h>
#include "Alice.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(5001, i) {
        if (i == X || i == 0) continue;
        res.push_back({X, i});
    }
    return res;
}
// 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 Bob(vector<pair<int, int>> edges) {
    vector<int> cnt(5001, 0);
    for (auto edge: edges) cnt[edge.first]++, cnt[edge.second]++;
    forto(5001, i) if (cnt[i] > 5) return i;
}

Compilation message

Alice.cpp: In function 'std::vector<std::pair<int, int> > Alice()':
Alice.cpp:16:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Alice.cpp:80:5: note: in expansion of macro 'forto'
   80 |     forto(5001, i) {
      |     ^~~~~

Bob.cpp: In function 'long long int Bob(std::vector<std::pair<int, int> >)':
Bob.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Bob.cpp:74:5: note: in expansion of macro 'forto'
   74 |     forto(5001, i) if (cnt[i] > 5) return i;
      |     ^~~~~
Bob.cpp:72:28: warning: control reaches end of non-void function [-Wreturn-type]
   72 |     vector<int> cnt(5001, 0);
      |                            ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1080 KB Correct.
2 Correct 2 ms 820 KB Correct.
3 Correct 1 ms 836 KB Correct.
4 Correct 2 ms 832 KB Correct.
5 Correct 2 ms 816 KB Correct.
6 Correct 2 ms 820 KB Correct.
7 Correct 2 ms 828 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 2 ms 832 KB Correct.
11 Correct 2 ms 832 KB Correct.
12 Correct 2 ms 816 KB Correct.

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1080 KB Correct.
2 Correct 2 ms 820 KB Correct.
3 Correct 1 ms 836 KB Correct.
4 Correct 2 ms 832 KB Correct.
5 Correct 2 ms 816 KB Correct.
6 Correct 2 ms 820 KB Correct.
7 Correct 2 ms 828 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 2 ms 832 KB Correct.
11 Correct 2 ms 832 KB Correct.
12 Correct 2 ms 816 KB Correct.
13 Incorrect 0 ms 344 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1080 KB Correct.
2 Correct 2 ms 820 KB Correct.
3 Correct 1 ms 836 KB Correct.
4 Correct 2 ms 832 KB Correct.
5 Correct 2 ms 816 KB Correct.
6 Correct 2 ms 820 KB Correct.
7 Correct 2 ms 828 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 2 ms 832 KB Correct.
11 Correct 2 ms 832 KB Correct.
12 Correct 2 ms 816 KB Correct.
13 Incorrect 0 ms 344 KB Output isn't correct
14 Halted 0 ms 0 KB -