QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#411778 | #4398. Luxury cruise ship | mobbb# | AC ✓ | 1ms | 3600kb | C++20 | 1.5kb | 2024-05-15 19:26:19 | 2024-05-15 19:26:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin >> n;
ll ans = n / 365;
ll rst = n % 365;
if (7 * 31 - 7 - 31 <= rst){
ll res = 1e18;
for (int i = 0;i * 7 <= rst;i++){
if ((rst - 1ll * i * 7) % 31 == 0){
res = min(res,i + (rst - i * 7) / 31);
}
}
if (res == 1e18){
cout << "-1\n";
}else {
cout << res + ans << "\n";
}
}else{
ll res = 1e18;
for (int i = 0;i * 7 <= rst;i++){
if ((rst - i * 7) % 31 == 0){
res = min(res,i + (rst - i * 7) / 31);
}
}
if (res != 1e18){
cout << res + ans << "\n";
return;
}
if (ans >= 1){
ans--;
rst += 365;
ll res = 1e18;
for (int i = 0;i * 7 <= rst;i++){
if ((rst - 1ll * i * 7) % 31 == 0){
res = min(res,i + (rst - i * 7) / 31);
}
}
if (res == 1e18){
cout << "-1\n";
}else {
cout << res + ans << "\n";
}
}else{
cout << "-1\n";
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--){
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3600kb
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