QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#99995#4398. Luxury cruise ship3360550356AC ✓2ms3972kbC++14807b2023-04-24 12:19:462023-04-24 12:19:50

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-24 12:19:50]
  • 评测
  • 测评结果：AC
  • 用时：2ms
  • 内存：3972kb
查看
  • [2023-04-24 12:19:46]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define PII pair<int,int>
#define X first
#define Y second
const int INF=0x3f3f3f3f3f3f3f3f;
const int N=7*31*366;
const int M=7*31*365;
using namespace std;

int f[N];
void fun(){
	
	memset(f,0x3f,sizeof(f)); 
	f[0]=0;
	int a[3]={7,31,365};
	//完全背包 
	for(int i=0;i<3;i++){
		for(int j=a[i];j<=M;j++){
			f[j]=min(f[j],f[j-a[i]]+1);
		}
	}
}

//考虑用背包来做 
void solve(){
	int n;
	cin>>n;
	if(n<=M){
		if(f[n]<INF)cout<<f[n]<<endl;
		else cout<<"-1"<<endl; 
	}else{
		
		int x=n-M;
		int ans=(x+364)/365;
		int y=n-365*ans;
		ans+=f[y];
		if(ans<INF)cout<<ans<<endl;
		else cout<<"-1"<<endl;
		
	}
	

}

signed main(){
	int T;
	T=1;
	fun();
	cin>>T;
	while(T--){
		solve();
	}
	return 0;
}
源文件, 语言: C++14

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3972kb

input:

1000
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101...

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:

ok 1000 lines
English 繁體中文 简体中文

伺服器時間: 2024-11-30 04:54:16 | 開源專案