京都大学プログラミングコンテスト2015

Submission #1692340

Source codeソースコード

#include<bits/stdc++.h>
#define loop(i, a, b) for(int i = a; i < b; i++) 
#define rep(i, a) loop(i, 0, a)
using namespace std;
const int MOD = 1000000007;
const int inf = 1e9;
using vi = vector <int>;
using vvi = vector <vi>;
using vc = vector <char>;
using vvc = vector <vc>;
using vs = vector <string>;
using vvs = vector <vs>;
//g++ -std==c++14
//setprecision(10)
vvi G;
int main(){
    int t;
    cin >> t;
    rep(va, t){
        int n;
        cin >> n;
        G = vvi(n, vi(n));
        rep(i, n)rep(j, n){
            cin >> G[i][j];
            if(G[i][j] == -1)
                G[i][j] = inf;
            if(G[i][j] && i == j){
                cout << "NO" << endl;
                goto matoba;
            }
        }
        rep(k, n)rep(i, n)rep(j, n)
            if(G[i][j] > G[i][k] + G[k][j]){
                cout << "NO" << endl;
                goto matoba;
            }
        cout << "YES" << endl;
        matoba:;
    }
}

Submission

Task問題 C - 最短経路
User nameユーザ名 masumi
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 RE
Score得点 0
Source lengthソースコード長 986 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
All 0 / 100 00_sample.txt,10_random_00.txt,10_random_01.txt,10_random_02.txt,10_random_03.txt,10_random_04.txt,10_random_05.txt,10_random_06.txt,10_random_07.txt,10_random_08.txt,10_random_09.txt,10_random_10.txt,10_random_11.txt,10_random_12.txt,10_random_13.txt,10_random_14.txt,10_random_15.txt,10_random_16.txt,10_random_17.txt,10_random_18.txt,10_random_19.txt,10_random_20.txt,10_random_21.txt,10_random_22.txt,10_random_23.txt,10_random_24.txt,10_random_25.txt,10_random_26.txt,10_random_27.txt,10_random_28.txt,10_random_29.txt,22_random_30.txt,22_random_31.txt,23_coplete_32.txt,23_coplete_33.txt,24_path_34.txt,24_path_35.txt,25_tree_36.txt,25_tree_37.txt,26_noedge_38.txt,27_dot_39.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample.txt AC 1 ms 256 KB
10_random_00.txt RE
10_random_01.txt AC 7 ms 256 KB
10_random_02.txt AC 7 ms 256 KB
10_random_03.txt RE
10_random_04.txt AC 8 ms 256 KB
10_random_05.txt AC 7 ms 256 KB
10_random_06.txt RE
10_random_07.txt RE
10_random_08.txt RE
10_random_09.txt RE
10_random_10.txt AC 7 ms 256 KB
10_random_11.txt RE
10_random_12.txt RE
10_random_13.txt AC 7 ms 256 KB
10_random_14.txt RE
10_random_15.txt RE
10_random_16.txt AC 7 ms 256 KB
10_random_17.txt RE
10_random_18.txt RE
10_random_19.txt AC 7 ms 256 KB
10_random_20.txt AC 7 ms 256 KB
10_random_21.txt RE
10_random_22.txt RE
10_random_23.txt RE
10_random_24.txt RE
10_random_25.txt RE
10_random_26.txt RE
10_random_27.txt RE
10_random_28.txt RE
10_random_29.txt AC 7 ms 256 KB
22_random_30.txt RE
22_random_31.txt RE
23_coplete_32.txt AC 8 ms 256 KB
23_coplete_33.txt AC 8 ms 256 KB
24_path_34.txt RE
24_path_35.txt AC 7 ms 256 KB
25_tree_36.txt RE
25_tree_37.txt AC 7 ms 256 KB
26_noedge_38.txt RE
27_dot_39.txt AC 1 ms 256 KB