Submission #1386103


Source Code Expand

#include <stdio.h>
#include <algorithm>
using namespace std;

struct intv{
	int l,r,i;
	bool operator < (const intv& t)const{return r < t.r;}
}I[505];

const int non = -1000000000;
int N,S,W[505][505],D[505];

int main()
{
	freopen ("input.txt","r",stdin);

	scanf ("%d %d",&N,&S); S--;
	for (int i=0;i<N;i++){
		scanf ("%d %d",&I[i].l,&I[i].r), I[i].i = i;
		D[i] = non;
	}
	D[S] = I[S].r - I[S].l;
	sort(I,I+N);

	for (int i=0;i<N;i++) for (int j=0;j<N;j++) scanf ("%d",&W[i][j]);
	for (int k=0;k<N;k++) for (int i=0;i<N;i++) for (int j=0;j<N;j++) if (W[i][j] > W[i][k] + W[k][j]) W[i][j] = W[i][k] + W[k][j];

	for (int i=0;i<N;i++) if (D[I[i].i] != non) for (int j=0;j<N;j++){
		int mv = I[i].r + W[I[i].i][I[j].i];
		if (mv <= I[j].r){
			int c = D[I[i].i];
			if (mv <= I[j].l) c += I[j].r - I[j].l;
			else c += I[j].r - mv;
			if (D[I[j].i] < c)
				D[I[j].i] = c;
		}
	}

	int ans = 0;
	for (int i=0;i<N;i++) if (ans < D[i]) ans = D[i];
	printf ("%d\n",ans);

	return 0;
}

Submission Info

Submission Time
Task F - 7歳教
User august14
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1024 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:33: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen ("input.txt","r",stdin);
                                 ^
./Main.cpp:17:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d %d",&N,&S); S--;
                       ^
./Main.cpp:19:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d %d",&I[i].l,&I[i].r), I[i].i = i;
                                              ^
./Main.cpp:25:67: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=0;i<N;i++) for (int j=0;j<N;j++) scanf ("%d",&W[i][j]);
                                                                   ^

Judge Result

Set Name subtask_1 All
Score / Max Score 0 / 50 0 / 400
Status
WA × 26
WA × 102
Set Name Test Cases
subtask_1 0_00_sample_00.txt, 0_40_Small_DisjointRange_00_0010.txt, 0_40_Small_DisjointRange_04_0500.txt, 0_40_Small_DisjointRange_07_0030.txt, 0_40_Small_DisjointRange_08_0448.txt, 0_40_Small_DisjointRange_13_0121.txt, 0_40_Small_DisjointRange_14_0500.txt, 0_40_Small_DisjointRange_15_0010.txt, 0_40_Small_DisjointRange_16_0002.txt, 0_40_Small_DisjointRange_22_0081.txt, 0_40_Small_OverlapRange_01_0001.txt, 0_40_Small_OverlapRange_02_0061.txt, 0_40_Small_OverlapRange_09_0500.txt, 0_40_Small_OverlapRange_10_0010.txt, 0_40_Small_OverlapRange_11_0013.txt, 0_40_Small_OverlapRange_12_0043.txt, 0_40_Small_OverlapRange_17_0052.txt, 0_40_Small_OverlapRange_21_0016.txt, 0_40_Small_OverlapRange_24_0500.txt, 0_40_Small_RandomRange_03_0117.txt, 0_40_Small_RandomRange_05_0006.txt, 0_40_Small_RandomRange_06_0020.txt, 0_40_Small_RandomRange_18_0123.txt, 0_40_Small_RandomRange_19_0500.txt, 0_40_Small_RandomRange_20_0005.txt, 0_40_Small_RandomRange_23_0148.txt
All 0_00_sample_00.txt, 0_40_Small_DisjointRange_00_0010.txt, 0_40_Small_DisjointRange_04_0500.txt, 0_40_Small_DisjointRange_07_0030.txt, 0_40_Small_DisjointRange_08_0448.txt, 0_40_Small_DisjointRange_13_0121.txt, 0_40_Small_DisjointRange_14_0500.txt, 0_40_Small_DisjointRange_15_0010.txt, 0_40_Small_DisjointRange_16_0002.txt, 0_40_Small_DisjointRange_22_0081.txt, 0_40_Small_OverlapRange_01_0001.txt, 0_40_Small_OverlapRange_02_0061.txt, 0_40_Small_OverlapRange_09_0500.txt, 0_40_Small_OverlapRange_10_0010.txt, 0_40_Small_OverlapRange_11_0013.txt, 0_40_Small_OverlapRange_12_0043.txt, 0_40_Small_OverlapRange_17_0052.txt, 0_40_Small_OverlapRange_21_0016.txt, 0_40_Small_OverlapRange_24_0500.txt, 0_40_Small_RandomRange_03_0117.txt, 0_40_Small_RandomRange_05_0006.txt, 0_40_Small_RandomRange_06_0020.txt, 0_40_Small_RandomRange_18_0123.txt, 0_40_Small_RandomRange_19_0500.txt, 0_40_Small_RandomRange_20_0005.txt, 0_40_Small_RandomRange_23_0148.txt, 1_00_sample_01.txt, 1_00_sample_02.txt, 1_10_Random_00_0005.txt, 1_10_Random_01_0010.txt, 1_10_Random_02_0039.txt, 1_10_Random_03_0070.txt, 1_10_Random_04_0450.txt, 1_10_Random_05_0004.txt, 1_10_Random_06_0009.txt, 1_10_Random_07_0037.txt, 1_10_Random_08_0027.txt, 1_10_Random_09_0205.txt, 1_10_Random_10_0010.txt, 1_10_Random_11_0017.txt, 1_10_Random_12_0036.txt, 1_10_Random_13_0087.txt, 1_10_Random_14_0248.txt, 1_10_Random_15_0007.txt, 1_10_Random_16_0008.txt, 1_10_Random_17_0019.txt, 1_10_Random_18_0091.txt, 1_10_Random_19_0353.txt, 1_10_Random_20_0007.txt, 1_10_Random_21_0007.txt, 1_10_Random_22_0015.txt, 1_10_Random_23_0012.txt, 1_10_Random_24_0359.txt, 1_20_BinaryTree_DisjointRange_23_0500.txt, 1_20_BinaryTree_DisjointRange_37_0063.txt, 1_20_BinaryTree_OverlapRange_22_0458.txt, 1_20_BinaryTree_RandomRange_29_0090.txt, 1_20_Complete_OverlapRange_05_0064.txt, 1_20_Complete_OverlapRange_13_0049.txt, 1_20_Complete_OverlapRange_18_0220.txt, 1_20_Complete_RandomRange_14_0223.txt, 1_20_Complete_RandomRange_30_0494.txt, 1_20_ConnectedRandom_DisjointRange_10_0163.txt, 1_20_ConnectedRandom_OverlapRange_21_0028.txt, 1_20_Line_OverlapRange_36_0006.txt, 1_20_NoEdge_OverlapRange_03_0500.txt, 1_20_NoEdge_OverlapRange_06_0289.txt, 1_20_NoEdge_OverlapRange_12_0007.txt, 1_20_NoEdge_OverlapRange_15_0500.txt, 1_20_NoEdge_OverlapRange_27_0500.txt, 1_20_NoEdge_OverlapRange_35_0500.txt, 1_20_RandomTree_DisjointRange_04_0005.txt, 1_20_RandomTree_DisjointRange_34_0331.txt, 1_20_RandomTree_OverlapRange_07_0500.txt, 1_20_RandomTree_OverlapRange_32_0003.txt, 1_20_RandomTree_RandomRange_17_0081.txt, 1_20_Random_DisjointRange_20_0010.txt, 1_20_Random_RandomRange_33_0010.txt, 1_20_Ring_DisjointRange_02_0497.txt, 1_20_Ring_DisjointRange_11_0500.txt, 1_20_Ring_DisjointRange_16_0007.txt, 1_20_Ring_DisjointRange_31_0500.txt, 1_20_Ring_DisjointRange_39_0500.txt, 1_20_Ring_OverlapRange_01_0042.txt, 1_20_Ring_OverlapRange_09_0017.txt, 1_20_Ring_OverlapRange_25_0015.txt, 1_20_Ring_OverlapRange_26_0314.txt, 1_20_Ring_OverlapRange_38_0311.txt, 1_20_Star_DisjointRange_00_0009.txt, 1_20_Star_OverlapRange_08_0005.txt, 1_20_Star_OverlapRange_28_0003.txt, 1_20_Star_RandomRange_19_0500.txt, 1_20_Star_RandomRange_24_0003.txt, 1_30_DisConnected_DisjointRange_04_0062.txt, 1_30_DisConnected_OverlapRange_02_0451.txt, 1_30_DisConnected_OverlapRange_05_0172.txt, 1_30_DisConnected_OverlapRange_08_0105.txt, 1_30_DisConnected_RandomRange_00_0010.txt, 1_30_DisConnected_RandomRange_01_0097.txt, 1_30_DisConnected_RandomRange_03_0010.txt, 1_30_DisConnected_RandomRange_06_0010.txt, 1_30_DisConnected_RandomRange_07_0095.txt
Case Name Status Exec Time Memory
0_00_sample_00.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_00_0010.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_04_0500.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_07_0030.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_08_0448.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_13_0121.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_14_0500.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_15_0010.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_16_0002.txt WA 0 ms 128 KB
0_40_Small_DisjointRange_22_0081.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_01_0001.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_02_0061.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_09_0500.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_10_0010.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_11_0013.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_12_0043.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_17_0052.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_21_0016.txt WA 0 ms 128 KB
0_40_Small_OverlapRange_24_0500.txt WA 0 ms 128 KB
0_40_Small_RandomRange_03_0117.txt WA 0 ms 128 KB
0_40_Small_RandomRange_05_0006.txt WA 0 ms 128 KB
0_40_Small_RandomRange_06_0020.txt WA 0 ms 128 KB
0_40_Small_RandomRange_18_0123.txt WA 0 ms 128 KB
0_40_Small_RandomRange_19_0500.txt WA 0 ms 128 KB
0_40_Small_RandomRange_20_0005.txt WA 0 ms 128 KB
0_40_Small_RandomRange_23_0148.txt WA 0 ms 128 KB
1_00_sample_01.txt WA 0 ms 128 KB
1_00_sample_02.txt WA 0 ms 128 KB
1_10_Random_00_0005.txt WA 0 ms 128 KB
1_10_Random_01_0010.txt WA 0 ms 128 KB
1_10_Random_02_0039.txt WA 0 ms 128 KB
1_10_Random_03_0070.txt WA 0 ms 128 KB
1_10_Random_04_0450.txt WA 1 ms 128 KB
1_10_Random_05_0004.txt WA 0 ms 128 KB
1_10_Random_06_0009.txt WA 0 ms 128 KB
1_10_Random_07_0037.txt WA 0 ms 128 KB
1_10_Random_08_0027.txt WA 0 ms 128 KB
1_10_Random_09_0205.txt WA 0 ms 128 KB
1_10_Random_10_0010.txt WA 0 ms 128 KB
1_10_Random_11_0017.txt WA 0 ms 128 KB
1_10_Random_12_0036.txt WA 0 ms 128 KB
1_10_Random_13_0087.txt WA 0 ms 128 KB
1_10_Random_14_0248.txt WA 0 ms 128 KB
1_10_Random_15_0007.txt WA 0 ms 128 KB
1_10_Random_16_0008.txt WA 0 ms 128 KB
1_10_Random_17_0019.txt WA 0 ms 128 KB
1_10_Random_18_0091.txt WA 0 ms 128 KB
1_10_Random_19_0353.txt WA 0 ms 128 KB
1_10_Random_20_0007.txt WA 0 ms 128 KB
1_10_Random_21_0007.txt WA 0 ms 128 KB
1_10_Random_22_0015.txt WA 0 ms 128 KB
1_10_Random_23_0012.txt WA 1 ms 128 KB
1_10_Random_24_0359.txt WA 0 ms 128 KB
1_20_BinaryTree_DisjointRange_23_0500.txt WA 0 ms 128 KB
1_20_BinaryTree_DisjointRange_37_0063.txt WA 1 ms 128 KB
1_20_BinaryTree_OverlapRange_22_0458.txt WA 0 ms 128 KB
1_20_BinaryTree_RandomRange_29_0090.txt WA 0 ms 128 KB
1_20_Complete_OverlapRange_05_0064.txt WA 0 ms 128 KB
1_20_Complete_OverlapRange_13_0049.txt WA 0 ms 128 KB
1_20_Complete_OverlapRange_18_0220.txt WA 0 ms 128 KB
1_20_Complete_RandomRange_14_0223.txt WA 0 ms 128 KB
1_20_Complete_RandomRange_30_0494.txt WA 0 ms 128 KB
1_20_ConnectedRandom_DisjointRange_10_0163.txt WA 0 ms 128 KB
1_20_ConnectedRandom_OverlapRange_21_0028.txt WA 1 ms 128 KB
1_20_Line_OverlapRange_36_0006.txt WA 0 ms 128 KB
1_20_NoEdge_OverlapRange_03_0500.txt WA 0 ms 128 KB
1_20_NoEdge_OverlapRange_06_0289.txt WA 1 ms 128 KB
1_20_NoEdge_OverlapRange_12_0007.txt WA 0 ms 128 KB
1_20_NoEdge_OverlapRange_15_0500.txt WA 0 ms 128 KB
1_20_NoEdge_OverlapRange_27_0500.txt WA 0 ms 128 KB
1_20_NoEdge_OverlapRange_35_0500.txt WA 0 ms 128 KB
1_20_RandomTree_DisjointRange_04_0005.txt WA 0 ms 128 KB
1_20_RandomTree_DisjointRange_34_0331.txt WA 0 ms 128 KB
1_20_RandomTree_OverlapRange_07_0500.txt WA 0 ms 128 KB
1_20_RandomTree_OverlapRange_32_0003.txt WA 0 ms 128 KB
1_20_RandomTree_RandomRange_17_0081.txt WA 0 ms 128 KB
1_20_Random_DisjointRange_20_0010.txt WA 0 ms 128 KB
1_20_Random_RandomRange_33_0010.txt WA 0 ms 128 KB
1_20_Ring_DisjointRange_02_0497.txt WA 0 ms 128 KB
1_20_Ring_DisjointRange_11_0500.txt WA 0 ms 128 KB
1_20_Ring_DisjointRange_16_0007.txt WA 0 ms 128 KB
1_20_Ring_DisjointRange_31_0500.txt WA 0 ms 128 KB
1_20_Ring_DisjointRange_39_0500.txt WA 0 ms 128 KB
1_20_Ring_OverlapRange_01_0042.txt WA 0 ms 128 KB
1_20_Ring_OverlapRange_09_0017.txt WA 0 ms 128 KB
1_20_Ring_OverlapRange_25_0015.txt WA 0 ms 128 KB
1_20_Ring_OverlapRange_26_0314.txt WA 0 ms 128 KB
1_20_Ring_OverlapRange_38_0311.txt WA 0 ms 128 KB
1_20_Star_DisjointRange_00_0009.txt WA 0 ms 128 KB
1_20_Star_OverlapRange_08_0005.txt WA 0 ms 128 KB
1_20_Star_OverlapRange_28_0003.txt WA 0 ms 128 KB
1_20_Star_RandomRange_19_0500.txt WA 0 ms 128 KB
1_20_Star_RandomRange_24_0003.txt WA 1 ms 128 KB
1_30_DisConnected_DisjointRange_04_0062.txt WA 0 ms 128 KB
1_30_DisConnected_OverlapRange_02_0451.txt WA 0 ms 128 KB
1_30_DisConnected_OverlapRange_05_0172.txt WA 0 ms 128 KB
1_30_DisConnected_OverlapRange_08_0105.txt WA 0 ms 128 KB
1_30_DisConnected_RandomRange_00_0010.txt WA 0 ms 128 KB
1_30_DisConnected_RandomRange_01_0097.txt WA 0 ms 128 KB
1_30_DisConnected_RandomRange_03_0010.txt WA 0 ms 128 KB
1_30_DisConnected_RandomRange_06_0010.txt WA 0 ms 128 KB
1_30_DisConnected_RandomRange_07_0095.txt WA 0 ms 128 KB