Submission #42207812


Source Code Expand

#include<cstdio>
#include<cstring>
#define fep(i,x,y) for(int i=x;i<=y;i++)
#define feq(i,x,y) for(int i=y;i>=x;i--)
#define N 210
#define INF 999999999
using namespace std;
typedef long long LL;
inline int mymin(int x,int y){return x<y?x:y;}
inline int mymax(int x,int y){return x>y?x:y;}
int a[N][N];
int n,K,Q;
inline LL chu1(LL x){return (x-1)%n+1;}
inline int chu2(int x){return x>n+n?-1:x;}
int main(){
	scanf("%d%d",&n,&K);
	memset(a,20,sizeof(a));
	int nn=n+n;
	fep(i,1,n){
		fep(j,1,n){
			int x;scanf("%d",&x);
			if(x)a[i][j]=a[i+n][j]=a[i][j+n]=a[i+n][j+n]=x;
		}
	}
	fep(i,1,nn){
		fep(j,1,nn){
			fep(k,1,nn)a[j][k]=mymin(a[j][i]+a[i][k],a[j][k]);
		}
	}
	scanf("%d",&Q);
	fep(i,1,Q){
		LL x,y;scanf("%lld%lld",&x,&y);
		if(x%n==y%n){
			if(x==y)printf("0\n");
			else printf("%d\n",chu2(a[chu1(x)][chu1(x)+n]));
		}
		else printf("%d\n",chu2(a[chu1(x)][chu1(y)]));
	}
	return 0;
}

Submission Info

Submission Time
Task A - Copy and Paste Graph
User juruozjj
Language C++ (GCC 9.2.1)
Score 300
Code Size 934 Byte
Status AC
Exec Time 23 ms
Memory 1908 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:16:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   16 |  scanf("%d%d",&n,&K);
      |  ~~~~~^~~~~~~~~~~~~~
./Main.cpp:21:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   21 |    int x;scanf("%d",&x);
      |          ~~~~~^~~~~~~~~
./Main.cpp:30:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   30 |  scanf("%d",&Q);
      |  ~~~~~^~~~~~~~~
./Main.cpp:32:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   32 |   LL x,y;scanf("%lld%lld",&x,&y);
      |          ~~~~~^~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 40
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 02_smallM_00.txt, 02_smallM_01.txt, 02_smallM_02.txt, 02_smallM_03.txt, 02_smallM_04.txt, 03_largeM_00.txt, 03_largeM_01.txt, 03_largeM_02.txt, 03_largeM_03.txt, 03_largeM_04.txt, 04_dag_00.txt, 04_dag_01.txt, 04_dag_02.txt, 04_dag_03.txt, 04_dag_04.txt, 04_dag_05.txt, 04_dag_06.txt, 04_dag_07.txt, 04_dag_08.txt, 04_dag_09.txt, 05_path_00.txt, 05_path_01.txt, 05_path_02.txt, 05_path_03.txt, 06_minmax_00.txt, 06_minmax_01.txt, 06_minmax_02.txt, 06_minmax_03.txt, 06_minmax_04.txt, 06_minmax_05.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 4 ms 1828 KiB
00_sample_01.txt AC 1 ms 1800 KiB
01_rnd_00.txt AC 14 ms 1852 KiB
01_rnd_01.txt AC 15 ms 1900 KiB
01_rnd_02.txt AC 15 ms 1824 KiB
01_rnd_03.txt AC 17 ms 1848 KiB
01_rnd_04.txt AC 19 ms 1852 KiB
01_rnd_05.txt AC 15 ms 1820 KiB
01_rnd_06.txt AC 18 ms 1804 KiB
01_rnd_07.txt AC 18 ms 1832 KiB
02_smallM_00.txt AC 17 ms 1884 KiB
02_smallM_01.txt AC 16 ms 1812 KiB
02_smallM_02.txt AC 18 ms 1820 KiB
02_smallM_03.txt AC 19 ms 1852 KiB
02_smallM_04.txt AC 16 ms 1812 KiB
03_largeM_00.txt AC 16 ms 1904 KiB
03_largeM_01.txt AC 23 ms 1856 KiB
03_largeM_02.txt AC 18 ms 1808 KiB
03_largeM_03.txt AC 18 ms 1852 KiB
03_largeM_04.txt AC 16 ms 1820 KiB
04_dag_00.txt AC 20 ms 1848 KiB
04_dag_01.txt AC 15 ms 1800 KiB
04_dag_02.txt AC 19 ms 1824 KiB
04_dag_03.txt AC 17 ms 1804 KiB
04_dag_04.txt AC 16 ms 1844 KiB
04_dag_05.txt AC 17 ms 1848 KiB
04_dag_06.txt AC 18 ms 1804 KiB
04_dag_07.txt AC 16 ms 1808 KiB
04_dag_08.txt AC 16 ms 1800 KiB
04_dag_09.txt AC 16 ms 1852 KiB
05_path_00.txt AC 17 ms 1900 KiB
05_path_01.txt AC 19 ms 1844 KiB
05_path_02.txt AC 18 ms 1908 KiB
05_path_03.txt AC 17 ms 1904 KiB
06_minmax_00.txt AC 2 ms 1816 KiB
06_minmax_01.txt AC 1 ms 1828 KiB
06_minmax_02.txt AC 16 ms 1808 KiB
06_minmax_03.txt AC 16 ms 1848 KiB
06_minmax_04.txt AC 16 ms 1856 KiB
06_minmax_05.txt AC 18 ms 1812 KiB