QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#280290#4398. Luxury cruise shipchunzhifengAC ✓4ms7580kbC++14682b2023-12-09 14:57:132023-12-09 14:57:14

Judging History

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

  • [2023-12-09 14:57:14]
  • 评测
  • 测评结果:AC
  • 用时:4ms
  • 内存:7580kb
  • [2023-12-09 14:57:13]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned ll
#define endl "\n"
#define PII pair<int,int>
const ll INF=0x3f3f3f3f;//3f3f3f3f;
const int mod=998244353;
const int N=1e6+5;
int f[N];
void init(){
	memset(f,0x3f,sizeof f);
	f[0]=0;
	for(int w:{7,31,365}){
		for(int i=w;i<N;i++){
			f[i]=min(f[i],f[i-w]+1);
		}
	}
	for(int i=1;i<N;i++) if(f[i]==INF) f[i]=-1;
}
void solve(){
	ll n; cin>>n;
	if(n<N){
		cout<<f[n]<<endl;
	}else{
		ll t=n/365000;
		n%=365000;
		cout<<t*1000+f[n]<<endl; 
	}
}
int main(){
	init();
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T=1; cin>>T;
    while(T--) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 4ms
memory: 7580kb

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