Submission #74274815

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <tuple>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstdint>
#include <cmath>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); } }init;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vl = vector<ll>;
using v2 = vector<vector<ll>>;
template<typename T,typename U>
istream &operator>>(istream &is,pair<T,U> &p) {
    is >> p.first >> p.second;
    return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}
#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define foreach(i,vec) for (auto i = begin(vec);i != end(vec);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
constexpr ll INF = 1e18;
int main()
{
    int n;
    cin >> n;
    vector<vector<int>> c(n,vector<int>(n));
    rep(i,0,n-1)
    {
        rep(j,i + 1,n) {
            cin >> c[i][j];
        }
    }
    rep(i,0,n) {
        rep(j,0,n) {
            rep(k,0,n) {
                if(i >= j || j >= k) continue;
                if(c[i][j] + c[j][k] < c[i][k]) {
                    Yes;
                    return 0;
                }
            }
        }
    }
    No;

}

Submission Info

Judge Result