Submission #74281661

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
typedef unsigned __int128 ulll;

void solve() {
    int n;
    cin >> n;
    vector<vector<int>> cost(n+1,vector<int>(n+1,0));
    for (int i = 1;i <= n-1;i++) {
        for (int j = i+1;j <= n;j++) {
            cin >> cost[i][j];
        }
    }
    for (int i = 1;i <= n;i++) {
        for (int j = i+1;j <= n;j++) {
            for (int k = j+1;k <= n;k++) {
                int total = cost[i][k];
                int diff = cost[i][j] + cost[j][k];
                if (diff < total) {
                    cout << "Yes";
                    return;
                }
            }
        }
    }
    cout << "No";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}

Submission Info

Judge Result