提交记录 #57779

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#57779	#4398. Luxury cruise ship	qinjianbin	WA	0ms	3812kb	C++17	693b	2022-10-22 21:30:38	2022-10-22 21:30:40

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-10-22 21:30:40]
评测

测评结果：WA
用时：0ms
内存：3812kb

查看

[2022-10-22 21:30:38]
提交

answer

#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define _for(i, a, b) for(int i = (a); i <= (b); i++)
using namespace std;

typedef long long ll;
const int N = 1e3 + 10;
int f[N];

int main()
{
	memset(f, 0x3f, sizeof f);
	f[0] = 0;

	int w[] = {7, 31};
	_for(i, 1, 1e3)
		rep(j, 0, 2)
			if(i - w[j] >= 0)
				f[i] = min(f[i], f[i - w[j]] + 1);
	
	int T; scanf("%d", &T);
	while(T--)
	{
		ll x; scanf("%lld", &x);

		if(x <= 365) 
		{
			printf("%d\n", f[x] > 1e9 ? -1 : f[x]);
			continue;
		}

		if(f[x % 365]) printf("%lld\n", x / 365 + f[x % 365]);
		else printf("%lld\n", x / 365 - 1 + f[(x % 365) + 365]);
	}

	return 0;
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 0

Wrong Answer

time: 0ms

memory: 3812kb

input:

output:

-1
-1
-1
-1
-1
-1
1
-1
-1
-1
-1
-1
-1
2
-1
-1
-1
-1
-1
-1
3
-1
-1
-1
-1
-1
-1
4
-1
-1
1
-1
-1
-1
5
-1
-1
2
-1
-1
-1
6
-1
-1
3
-1
-1
-1
7
-1
-1
4
-1
-1
-1
8
-1
-1
5
-1
-1
2
9
-1
-1
6
-1
-1
3
10
-1
-1
7
-1
-1
4
11
-1
-1
8
-1
-1
5
12
-1
-1
9
-1
-1
6
13
-1
3
10
-1
-1
7
14
-1
4
11
-1
-1
8
15
-1
5
12
-1
-...

result:

wrong answer 203rd lines differ - expected: '36', found: '1061109576'

QOJ.ac

QOJ

Judging History

answer

詳細信息

Test #1:

input:

output:

result: