提出 #74285296

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n; cin >> n;
    vector<vector<int>> map(n+1, vector<int>(n+1, 0));
    bool found = false;

    for (int i = 1; i <= n-1; i++) {
        for (int j = i + 1; j <= n; j++) {
            cin >> map[i][j];
        }
    }

    for (int i = 1; i <= n-1; i++) {
        for (int j = i+1; j <= n; j++) {
            for (int k = j+1; k <= n; k++) {
                if (map[i][j] + map[j][k] < map[i][k]) {
                    found = true;
                    break;
                }
            }
        }
    }
    
    

    if (found) cout << "Yes\n";
    else cout << "No\n";
}

提出情報

ジャッジ結果