Submission #1771780


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
 
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)      //repeat n times
#define REP2(i,s,n) for(int (i)=(s);(i)<(n);(i)++) //repeat from s to n 
#define REPD(i,n) for(int (i)=(n);(i)>=0;(i)--)    //repeat from n to 0
#define REPD2(i,s,e) for(int (i)=(s);(i)>=(e);(i)--) //repeat from s to e
#define ASIZE(a) (sizeof(a) / sizeof(a[0]))        //array size
#define SORTD(a) sort(a,a+ASIZE(a),greater<int>()) //sort in descending order for array
#define SORTA(a) sort(a,a+ASIZE(a))                //sort in ascending order for array
#define SORTS(a) sort(a.begin(),a.end())           //sort in ascending order for string type
typedef long long LL;
typedef unsigned int UINT;
typedef pair<int, int> P;
 
void SCAN(int *a){scanf("%d",a);}                             //scan for type int
void SCAN(int *a,int n){int i;REP(i,n){scanf("%d",&a[i]);}}   //scan for type int array
void SCAN(UINT *a){scanf("%u",a);}                            //scan for type unsigned int
void SCAN(UINT *a,int n){int i;REP(i,n){scanf("%u",&a[i]);}}  //scan for type unsigned int array
void SCAN(LL *a){scanf("%lld",a);}                            //scan for type long long int
void SCAN(LL *a,int n){int i;REP(i,n){scanf("%lld",&a[i]);}}  //scan for type long long int array
void SCAN(char *c){scanf(" %c",c);}                           //scan for type char
void SCAN(char *c,int n){int i;REP(i,n){scanf(" %c",&c[i]);}} //scan for type char array
 
const int MOD = 1000000007;
const int INF = 1999999999;
const LL INFLL = 999999999999999;

const int DX4[4]= {-1,0,1,0};
const int DY4[4]= {0,-1,0,1};

//fill an N-dimensional array with val
template<typename A, size_t N, typename T>
void FILL(A (&array)[N], const T &val){
	fill((T*)array,(T*)(array+N),val);
}
 
long double pascalTri(int n,int r){
	long double tri[n+1][n+1];
	int i,j;
	REP(i,n+1){REP(j,n+1){tri[i][j]=0;}}
	REP(i,n+1){
		REP(j,n+1){
			if(j>i){break;}
			if(j==0||j==i){tri[i][j]=1;}else{tri[i][j]=(tri[i-1][j-1]+tri[i-1][j]);}
		}
	}
	return tri[n][r];
}


int dist[305][305];

int main(){
	// cin.tie(0);
	// ios::sync_with_stdio(false);
	int n,m;
	int i,j,k;

	SCAN(&n);SCAN(&m);

	FILL(dist,INF/2);
	REP(i,n){
		dist[i][i]=0;
	}
	
	int a[m],b[m],t[m];
	REP(i,m){
		SCAN(&a[i]);SCAN(&b[i]);SCAN(&t[i]);
		dist[a[i]-1][b[i]-1]=dist[b[i]-1][a[i]-1]=t[i];
	}

	
	REP(k,n){
		REP(i,n){
			REP(j,n){
				dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
			}
		}
	}

	int temp1=0;
	int temp2=INF;
	REP(i,n){
		temp1=0;
		REP(j,n){
			temp1=max(temp1,dist[i][j]);
		}
		temp2=min(temp2,temp1);
	}
	printf("%d\n",temp2);

	return 0;
}

Submission Info

Submission Time
Task D - バスと避けられない運命
User nabe12
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2708 Byte
Status AC
Exec Time 44 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘void SCAN(int*)’:
./Main.cpp:16:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void SCAN(int *a){scanf("%d",a);}                             //scan for type int
                                ^
./Main.cpp: In function ‘void SCAN(int*, int)’:
./Main.cpp:17:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void SCAN(int *a,int n){int i;REP(i,n){scanf("%d",&a[i]);}}   //scan for type int array
                                                         ^
./Main.cpp: In function ‘void SCAN(UINT*)’:
./Main.cpp:18:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void SCAN(UINT *a){scanf("%u",a);}                            //scan for type unsigned int
                                 ^
./Main.cpp: In function ‘void SCAN(UINT*, int)’:
./Main.cpp:19...

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 39
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 640 KB
sample_02.txt AC 2 ms 640 KB
sample_03.txt AC 2 ms 640 KB
test_01.txt AC 2 ms 640 KB
test_02.txt AC 32 ms 640 KB
test_03.txt AC 44 ms 1152 KB
test_04.txt AC 12 ms 640 KB
test_05.txt AC 16 ms 768 KB
test_06.txt AC 3 ms 640 KB
test_07.txt AC 33 ms 1024 KB
test_08.txt AC 2 ms 640 KB
test_09.txt AC 12 ms 768 KB
test_10.txt AC 3 ms 640 KB
test_11.txt AC 3 ms 640 KB
test_12.txt AC 18 ms 640 KB
test_13.txt AC 3 ms 640 KB
test_14.txt AC 4 ms 640 KB
test_15.txt AC 31 ms 1024 KB
test_16.txt AC 5 ms 640 KB
test_17.txt AC 13 ms 768 KB
test_18.txt AC 17 ms 640 KB
test_19.txt AC 5 ms 640 KB
test_20.txt AC 4 ms 640 KB
test_21.txt AC 2 ms 640 KB
test_22.txt AC 7 ms 640 KB
test_23.txt AC 2 ms 640 KB
test_24.txt AC 32 ms 640 KB
test_25.txt AC 32 ms 640 KB
test_26.txt AC 8 ms 640 KB
test_27.txt AC 11 ms 640 KB
test_28.txt AC 32 ms 640 KB
test_29.txt AC 32 ms 640 KB
test_30.txt AC 3 ms 640 KB
test_31.txt AC 2 ms 640 KB
test_32.txt AC 32 ms 640 KB
test_33.txt AC 32 ms 640 KB
test_34.txt AC 2 ms 640 KB
test_35.txt AC 7 ms 640 KB
test_36.txt AC 32 ms 640 KB