QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#444499#8519. Radarsucup-team3659#WA 0ms3732kbC++17965b2024-06-15 19:38:172024-06-15 19:38:19

Judging History

你现在查看的是最新测评结果

  • [2024-06-15 19:38:19]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3732kb
  • [2024-06-15 19:38:17]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long 
using namespace std;
int a[505][505];
int val[10];
const int inf=0x3f3f3f3f3f3f3f3f;
void test()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			cin>>a[i][j];
	int m=n/2;
	for(int i=1;i<10;i++)
		val[i]=inf;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			int x=(i<=m)+(i<=m+1),y=1+(j<=m)+(j<=m+1);
			val[3*x+y]=min(val[3*x+y],a[i][j]);
		}
	val[2]=min(val[2],val[1]+val[3]);
	val[4]=min(val[4],val[1]+val[7]);
	val[6]=min(val[6],val[3]+val[9]);
	val[8]=min(val[8],val[7]+val[9]);
	val[5]=min({val[5],val[2]+val[8],val[4]+val[6],val[1]+val[6]+val[8],val[3]+val[4]+val[8],val[7]+val[2]+val[6],val[9]+val[2]+val[4]});
	cout<<val[5]<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	for(int i=1;i<=t;i++)
		test();
}
/*
2
3
1 1 1
1 1 1
1 1 1
5
8 5 2 8 3
5 6 9 7 3
7 8 9 1 4
8 9 4 5 5
2 8 6 9 3
*/

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3732kb

input:

2
3
1 1 1
1 1 1
1 1 1
5
8 5 2 8 3
5 6 9 7 3
7 8 9 1 4
8 9 4 5 5
2 8 6 9 3

output:

1
5

result:

ok 2 number(s): "1 5"

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3556kb

input:

1
1
444739567

output:

-4774451407313060419

result:

wrong answer 1st numbers differ - expected: '444739567', found: '-4774451407313060419'