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

Submission #1590388

Source codeソースコード

// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
//#include <tuple>
//#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>

// etc
#include <cmath>
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>


#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")";
	return os;
}

#define int ll
using ll = long long;
using ull = unsigned long long;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

signed main() {
	INIT;
	VAR(int, T);
	REP(_, T) {
		VAR(int, n);
		MAT(int, a, n, n);
		bool f = true;
		REP(i, n) if (a[i][i] != 0) f = false;
		REP(i, n) REP(j, n) if (a[i][j] == -1) a[i][j] = INFINT;
		REP(k, n) REP(i, n) REP(j, n) if (a[i][j] > a[i][k] + a[k][j]) f = false;
		OUT((f ? "YES" : "NO"))BR;
	}
	return 0;
}

Submission

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

Test case

Set

Set name Score得点 / Max score Cases
All 100 / 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 AC 4 ms 256 KB
10_random_01.txt AC 4 ms 256 KB
10_random_02.txt AC 4 ms 256 KB
10_random_03.txt AC 4 ms 256 KB
10_random_04.txt AC 4 ms 256 KB
10_random_05.txt AC 4 ms 256 KB
10_random_06.txt AC 4 ms 256 KB
10_random_07.txt AC 4 ms 256 KB
10_random_08.txt AC 4 ms 256 KB
10_random_09.txt AC 4 ms 256 KB
10_random_10.txt AC 4 ms 256 KB
10_random_11.txt AC 4 ms 256 KB
10_random_12.txt AC 4 ms 256 KB
10_random_13.txt AC 4 ms 256 KB
10_random_14.txt AC 4 ms 256 KB
10_random_15.txt AC 4 ms 256 KB
10_random_16.txt AC 4 ms 256 KB
10_random_17.txt AC 4 ms 256 KB
10_random_18.txt AC 4 ms 256 KB
10_random_19.txt AC 4 ms 256 KB
10_random_20.txt AC 4 ms 256 KB
10_random_21.txt AC 4 ms 256 KB
10_random_22.txt AC 4 ms 256 KB
10_random_23.txt AC 4 ms 256 KB
10_random_24.txt AC 4 ms 256 KB
10_random_25.txt AC 4 ms 256 KB
10_random_26.txt AC 4 ms 256 KB
10_random_27.txt AC 4 ms 256 KB
10_random_28.txt AC 4 ms 256 KB
10_random_29.txt AC 4 ms 256 KB
22_random_30.txt AC 4 ms 256 KB
22_random_31.txt AC 4 ms 256 KB
23_coplete_32.txt AC 4 ms 256 KB
23_coplete_33.txt AC 4 ms 256 KB
24_path_34.txt AC 4 ms 256 KB
24_path_35.txt AC 4 ms 256 KB
25_tree_36.txt AC 4 ms 256 KB
25_tree_37.txt AC 4 ms 256 KB
26_noedge_38.txt AC 4 ms 256 KB
27_dot_39.txt AC 1 ms 256 KB