QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#73236 | #4398. Luxury cruise ship | LiCooer | AC ✓ | 50ms | 81420kb | C++17 | 888b | 2023-01-23 08:40:41 | 2023-01-23 08:40:44 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 10000010;
const int inf = 1e18;
int a[N];
int dp[N];
int w[3];
void init()
{
memset(dp , 0x3f3f3f3f , sizeof dp);
dp[0] = 0;
for(int i = 0 ; i < 3 ; i ++ )
{
for(int j = w[i] ; j <= 10000000 ; j ++ )
{
dp[j] = min(dp[j] , dp[j - w[i]] + 1);
}
}
}
signed main()
{
w[0] = 7;
w[1] = 31;
w[2] = 365;
init();
int t;
cin >> t;
while(t -- )
{
int x;
cin >> x;
int res = x / 3650000;
int ans = res * 10000;
// int ans = x / 365;
x %= 3650000;
if(dp[x] > inf / 2)
{
cout << "-1" << "\n";
}
else
{
cout << ans + dp[x] << "\n";
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 50ms
memory: 81420kb
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