QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #251859 | #4398. Luxury cruise ship | PZheng | WA | 0ms | 3528kb | C++14 | 594b | 2023-11-15 11:03:13 | 2023-11-15 11:03:13 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int maxn=(31*7-31-7+1)*2;
long long f[maxn];
const long long inf=1e18;
void solve()
{
long long n;
cin>>n;
long long cnt=0;
cnt=n/365;
n%=365;
while(cnt&&n+365<maxn)
{
n+=365;
cnt--;
}
if(f[n]!=inf)
cout<<f[n]+cnt<<endl;
else
cout<<-1<<endl;
}
int main()
{
int t;
cin>>t;
f[0]=0;
for(int i=1;i<maxn;i++){
f[i]=inf;
if(i>=7)
f[i]=min(f[i-7]+1,f[i]);
if(i>=31)
f[i]=min(f[i-31]+1,f[i]);
if(i>=365)
f[i]=min(f[i-365]+1,f[i]);
}
while(t--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3528kb
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:
wrong answer 203rd lines differ - expected: '36', found: '-1'