QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#372806 | #4398. Luxury cruise ship | Ycfhnnd | AC ✓ | 3ms | 11484kb | C++20 | 960b | 2024-03-31 19:27:46 | 2024-03-31 19:27:46 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int N = 1e6 + 10;
i64 dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
int a[] = {7, 31, 365};
for (int i = 1;i < N ;i ++){
dp[i] = 1e18;
}
for (int i = 0;i < 3;i ++){
for (int j = a[i];j < N ;j ++){
dp[j] = min(dp[j], dp[j - a[i]] + 1);
}
}
for (int i = 1;i < N ;i ++){
if (dp[i] == 1e18){
dp[i] = -1;
}
}
for (int i = 0;i < n;i ++){
i64 x;
cin >> x;
if (x < N){
cout << dp[x] << "\n";
}else{
i64 t = (x - N + 364) / 365;
x -= t * 365;
if (dp[x] != -1){
cout << dp[x] + t << "\n";
}else{
cout << -1 << "\n";
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 3ms
memory: 11484kb
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