Submission #1869193
Source Code Expand
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x) cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif
//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 20)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
//ここから編集する
int main() {
int N;
cin >> N;
vector<vector<ll> > A(N,vector<ll>(N,0)),B;
rep(i,0,N){
rep(j,0,N){
cin >> A[i][j];
}
}
B = A;
rep(k,0,N){
rep(i,0,N){
rep(j,0,N){
if(A[i][j] == A[i][k] + A[k][j] && i != k && j != k){
B[i][j] = 0;
}else if(A[i][j] > A[i][k] + A[k][j]){
cout << -1 << endl;
return 0;
}
}
}
}
ll ans = 0;
rep(i,0,N){
rep(j,0,N){
ans += B[i][j];
}
}
ans /= 2;
cout << ans << endl;
return 0;
}
Submission Info
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
67 ms |
1664 KB |
02.txt |
AC |
68 ms |
1664 KB |
03.txt |
AC |
69 ms |
1664 KB |
04.txt |
AC |
66 ms |
1664 KB |
05.txt |
AC |
66 ms |
1664 KB |
06.txt |
AC |
64 ms |
1664 KB |
07.txt |
AC |
32 ms |
1664 KB |
08.txt |
AC |
58 ms |
1664 KB |
09.txt |
AC |
59 ms |
1664 KB |
10.txt |
AC |
32 ms |
1664 KB |
11.txt |
AC |
36 ms |
1664 KB |
12.txt |
AC |
36 ms |
1664 KB |
13.txt |
AC |
1 ms |
256 KB |
subtask0_0.txt |
AC |
1 ms |
256 KB |
subtask0_1.txt |
AC |
1 ms |
256 KB |
subtask0_2.txt |
AC |
1 ms |
256 KB |
subtask0_3.txt |
AC |
1 ms |
256 KB |