Submission #60942425

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <cassert>
#include <utility>
#include <sstream>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define lbi(v, x) (lower_bound(all(v), x) - v.begin())
#define ubi(v, x) (upper_bound(all(v), x) - v.begin())
#define sz(a) ((int)a.size())
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <cassert>
#include <utility>
#include <sstream>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(v) v.begin(), v.end()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define lbi(v, x) (lower_bound(all(v), x) - v.begin())
#define ubi(v, x) (upper_bound(all(v), x) - v.begin())
#define sz(a) ((int)a.size())
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)

using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using matrix = vector<vector<ll>>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vb = vector<bool>;
using vs = vector<string>;
using vvb = vector<vb>;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

ll gcd(ll a, ll b) { if (b==0) return a; else return gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a, b)*b; }
int ceil_pow(int n) {
    int x = 0;
    while((1U<<x) <(unsigned int)(n)) x++;
    return x;
}
vector<string> split_str(string s, const char delim = ' ') {
    vector<string> ret;
    stringstream ss(s);
    string t;
    while (getline(ss, t, delim)) {
        ret.push_back(t);
    }
    return ret;
}
ll power(ll a, ll n, ll MOD) {
    if (n==0) return 1;
    else if (n%2 == 0) return power((a*a) % MOD, n/2, MOD);
    else return (a * power((a*a) % MOD, (n-1)/2, MOD)) % MOD;
}
ll inverse(ll a, ll p) {
    return power(a, p-2, p);
}
matrix mat_mul(const matrix &a, const matrix &b, ll MOD) {
    ll size = a.size(), size2 = a[0].size(), size3=b[0].size();
    matrix res(size, vl(size3, 0));
    for(ll i=0; i<size; ++i) {
        for(ll j=0; j<size3;++j) {
            for(ll k=0; k<size2;++k) { res[i][j] = (res[i][j] + (a[i][k] * b[k][j]+MOD) % MOD) % MOD; }
        }
    }
    return res;
}
matrix power(matrix a, ll n, ll MOD) {
    ll size = a.size();
    matrix res(size, vl(size));
    for(ll i =0; i<size;++i) res[i][i] = 1;
    while(n>0) {
        if (n%2) res = mat_mul(res, a, MOD);
        n /= 2;
        a = mat_mul(a, a, MOD);
    }
    return res;
}
vvi get_medidan(const vi &arr) {
    int as = arr.size();
    vvi ans(as, vi(as));
    for(int i=0; i<as; ++i) {
        priority_queue<int> maxheap;
        priority_queue<int, vi, greater<int>> minheap;
        for(int j=i; j<as; ++j) {
            if(minheap.size() == maxheap.size()) maxheap.push(arr[i]);
            else minheap.push(arr[i]);
            if(!minheap.empty() && minheap.top() < maxheap.top()) {
                int maxtop = maxheap.top(); maxheap.pop();
                int mintop = minheap.top(); minheap.pop();
                maxheap.push(mintop);
                minheap.push(maxtop);
            }
            if(!minheap.empty() && minheap.size() == maxheap.size()) ans[i][j] = (minheap.top()+maxheap.top())/2;
            else ans[i][j] = maxheap.top();
        }
    }
    return ans;
}
vb SieveOfEratosthenes(int n) {
    vb is_prime(n+1, true);
    is_prime[0] = is_prime[1] = false;
    for(int i=2; i*i <=n; i++) {
        if(is_prime[i]) { for(int j=i*i; j<=n; j+=i) is_prime[j] = false;}
    }
    return is_prime;
}
int lis(vi arr) { // Longest Incresing sequence의 길이를 반환
const int INF=0x3f3f3f3f;
    int n = sz(arr);
    vi a_lis(n, INF);
    a_lis[0] = arr[0];
    int idx = 0;
    for(int i=1; i<n; ++i) {
        if(a_lis[idx]<arr[i]) {
            a_lis[++idx] = arr[i];
        }
        else {
            int n_idx = lbi(a_lis, arr[i]);
            assert(n_idx<n);
            a_lis[n_idx] = arr[i];
        }
    }
    return idx+1;
}
template<typename T>
int popcount(T x) {return __builtin_popcountll(x);}
template<typename T>
void chmax(T &x, T y) {x = max(x, y);}
template<typename T>
void chmin(T &x, T y) {x = min(x, y);}
template<typename T>
void asort(vector<T> &a) {sort(a.begin(), a.end());}
template<typename T>
void dsort(vector<T> &a) {sort(a.rbegin(), a.rend());}
vi calc_divisor(int n) { // n까지(포함)약수 갯수를 구하는 함수
    vi divi(n+1, 0);
    for(int i=1; i<n+1; ++i) {
        for(int j=1; j*i<n+1; ++j) {
            ++divi[j*i];
        }
    }
    return divi;
}
/////////////////////////////
vector<int> fac, inv, facinv;
const ll MOD = 998244353;
void modcalc(int n=3000) { // factorial, inverse factorial 구하는 함수
    fac.resize(n); inv.resize(n); facinv.resize(n);
    fac[0] = 1, fac[1] = 1;
    inv[1] = 1;
    facinv[0] = 1, facinv[1] = 1;
    for(int i=2; i<n; ++i) {
        fac[i] = (ll)fac[i-1] * i %MOD;
        inv[i] = MOD - (ll)(MOD/i) * inv[MOD%i] % MOD;
        facinv[i] = (ll)facinv[i-1] * inv[i] % MOD;
    }
}
int comb(int n, int k) { // combination 수 구하는 함수
    if(n<0 || k<0 || n<k) return 0;
    return ((ll)fac[n] * facinv[n-k] % MOD) * facinv[k] % MOD;
}
////////////////////////////////////////
// SCC algorithm
// 1) Each vertex is in exactly one list of the vertices.
// 2) Each list of the vertices corresponds to the vertex set of a strongly connected component. The order of the vertices in the list is undefined.
// 3)The list of list of the vertices are sorted in topological order, i.e., for two vertices u, v in different strongly connected components, if there is a directed path from u to v, the list contains u appears earlier than the list contains v.
namespace atcoder {
namespace internal {
template <class E> struct csr {
    std::vector<int> start;
    std::vector<E> elist;
    csr(int n, const std::vector<std::pair<int, E>>& edges)
        : start(n + 1), elist(edges.size()) {
        for (auto e : edges) {
            start[e.first + 1]++;
        }
        for (int i = 1; i <= n; i++) {
            start[i] += start[i - 1];
        }
        auto counter = start;
        for (auto e : edges) {
            elist[counter[e.first]++] = e.second;
        }
    }
};
}  // namespace internal
}  // namespace atcoder

namespace atcoder {
namespace internal {
struct scc_graph {
public:
    scc_graph(int n) : _n(n) {}
    int num_vertices() { return _n; }
    void add_edge(int from, int to) { edges.push_back({from, {to}}); }
    std::pair<int, std::vector<int>> scc_ids() {
        auto g = csr<edge>(_n, edges);
        int now_ord = 0, group_num = 0;
        std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);
        visited.reserve(_n);
        auto dfs = [&](auto self, int v) -> void {
            low[v] = ord[v] = now_ord++;
            visited.push_back(v);
            for (int i = g.start[v]; i < g.start[v + 1]; i++) {
                auto to = g.elist[i].to;
                if (ord[to] == -1) {
                    self(self, to);
                    low[v] = std::min(low[v], low[to]);
                } else {
                    low[v] = std::min(low[v], ord[to]);
                }
            }
            if (low[v] == ord[v]) {
                while (true) {
                    int u = visited.back();
                    visited.pop_back();
                    ord[u] = _n;
                    ids[u] = group_num;
                    if (u == v) break;
                }
                group_num++;
            }
        };
        for (int i = 0; i < _n; i++) {
            if (ord[i] == -1) dfs(dfs, i);
        }
        for (auto& x : ids) {
            x = group_num - 1 - x;
        }
        return {group_num, ids};
    }
    std::vector<std::vector<int>> scc() {
        auto ids = scc_ids();
        int group_num = ids.first;
        std::vector<int> counts(group_num);
        for (auto x : ids.second) counts[x]++;
        std::vector<std::vector<int>> groups(ids.first);
        for (int i = 0; i < group_num; i++) {
            groups[i].reserve(counts[i]);
        }
        for (int i = 0; i < _n; i++) {
            groups[ids.second[i]].push_back(i);
        }
        return groups;
    }
private:
    int _n;
    struct edge {
        int to;
    };
    std::vector<std::pair<int, edge>> edges;
};
}  // namespace internal
}  // namespace atcoder

namespace atcoder {
struct scc_graph {
public:
    scc_graph() : internal(0) {}
    scc_graph(int n) : internal(n) {}
    void add_edge(int from, int to) {
        int n = internal.num_vertices();
        assert(0 <= from && from < n);
        assert(0 <= to && to < n);
        internal.add_edge(from, to);
    }
    std::vector<std::vector<int>> scc() { return internal.scc(); }
private:
    internal::scc_graph internal;
};
}  // namespace atcoder
using namespace atcoder;
/////////////////////////////////////////////////////////
struct dsu {
    public:
        dsu(): _n(0) {}
        dsu(int n): _n(n), parent_or_size(n, -1) {}

        int merge(int a, int b) {
            assert(0 <= a && a < _n);
            assert(0 <= b && b < _n);
            int x = leader(a), y = leader(b);
            if (x==y) return x;
            if (-parent_or_size[x] < -parent_or_size[y]) swap(x, y);
            parent_or_size[x] += parent_or_size[y];
            parent_or_size[y] = x;
            return x;
        }

        bool same(int a, int b) {
            assert(0 <= a && a < _n);
            assert(0 <= b && b < _n);
            return leader(a) == leader(b);
        }

        int leader(int a) {
            assert(0 <= a && a < _n);
            if(parent_or_size[a] < 0) return a;
            return parent_or_size[a] = leader(parent_or_size[a]);
        }

        int size(int a) {
            assert(0 <= a && a < _n);
            return -parent_or_size[leader(a)];
        }

        vvi groups() {
            vi leader_buf(_n), group_size(_n);
            for (int i=0; i< _n; ++i) {
                leader_buf[i] = leader(i);
                group_size[leader_buf[i]]++;
            }
            vvi result(_n);
            for(int i=0; i<_n; ++i) {
                result[i].reserve(group_size[i]);
            }
            for(int i=0; i<_n; ++i) {
                result[leader_buf[i]].push_back(i);
            }
            result.erase(remove_if(result.begin(), result.end(), [&](const vi& v) {return v.empty();}), result.end());
            return result; 
        }

    private:
        int _n;
        vi parent_or_size;
};
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = ceil_pow(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }
    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
struct Edge {
    int u, v, weight;
    bool operator<(Edge const& other) {
        return weight < other.weight;
    }
    Edge(int u, int v, int weight):u(u), v(v), weight(weight) {}
};
struct Kruskal {
public:
    Kruskal(int n):num_node(n) {}
    void add_edge(int u, int v, int weight) {
        edges.push_back(Edge(u, v, weight));
    }
    ll mst() {
        asort(edges);
        dsu dj(num_node);
        // vector<Edge> results;
        int cnt = 0;
        for(Edge e: edges) {
            if(dj.leader(e.u) != dj.leader(e.v)) {
                mst_res+= e.weight;
                // results.push_back(e);
                dj.merge(e.u, e.v);
                ++cnt; // 결합되는 edge의 갯수를 반환
            }
        }
        if(cnt<num_node-1) return LINF;
        return mst_res;
    }
private:
    vector<Edge> edges;
    int num_node;
    ll mst_res = 0;
    const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
};
ll range_sum(vl& psum, int l, int r) {
    if(l>r) return 0ll;
    return psum[r+1] - psum[l];
}
template<typename Container> void show(Container&& c)
{
    for (const auto& n : c)
        std::cout << n << ", ";
    std::cout << std::endl;
}

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
// iota(all(x), initval) : initval로 시작하는 연속된 정수로 x 채워줌
// line의 경우 vector의 형태 ax + t(bx-ax)의 형태로 formulation하는 것이 수식에 유리
// string 확장에는 s2 = string(sz_diff, '0')+s2; 와 같이 접근해야지 절대 while(sz_diff--) s2 = "0"+s2; 접근하면 안된다.
// ordered_set, st.order_of_key(num) : ordered_set에서 num보다 작은(미만) 원소의 갯수 반환, 
//              st.find_by_order(k) : ordered_set에서 (k+1) 번째 원소가 있는 iterator 반환 (k==0 이면 1번째)
int a, b, c;

int main() {
    fastio;
    cin >> a >>b >> c;
    if((a == b && b == c) || a+b==c || b+c == a || a+c==b) cout << "Yes\n";
    else cout << "No\n";
    return 0;
}

Submission Info

Judge Result