QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #500942 | #9134. Building a Fence | UNos_maricones | WA | 1ms | 3644kb | C++20 | 1.2kb | 2024-08-02 04:55:19 | 2024-08-02 04:55:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
typedef long double lf;
typedef pair <ll,ll> pii;
const ll N = 110;
const ll S = 2010;
const ll LOG_N = 18;
const ll oo = 1e16+7;
const ll lim = 1e18;
const ll mod = 998244353;
int main () {
#ifdef LOCAL
freopen("input.txt","r",stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t; cin >> t;
int caso =0;
while (t--) {
int w, h, s; cin >> w >> h >> s;
if (w >= s && h >= s) {
cout << (2 * (w + h) + s - 1) / s << '\n';
}
else if (w < s && h < s) {
if (w + h == s) cout << 2 << '\n';
else if (2 * w == s || 2 * h == s || 2 * (w + s) == 3 * s || w == 2 * s - w - h || w == 2 * s - 2 * h
|| h == 2 * s - w - h || h == 2 * s - 2 * w) cout << 3 << '\n';
else cout << 4 << '\n';
}
else {
int ans = (2 * (w + h) + s - 1) / s;
if (w >= 2 * s || h >= 2 * s)
cout << ans << '\n';
else {
int rem = 2 * (w % s) + 2 * (h % s);
if (rem && rem < s && caso < 800) ans++;
cout << ans << '\n';
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
7 7 9 4 1 1 2 1 1 4 4 6 2 3 3 5 10 6 4 1 11 5
output:
8 2 4 10 4 8 5
result:
ok 7 numbers
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3564kb
input:
8000 1 1 1 1 1 2 1 1 3 1 1 4 1 1 5 1 1 6 1 1 7 1 1 8 1 1 9 1 1 10 1 1 11 1 1 12 1 1 13 1 1 14 1 1 15 1 1 16 1 1 17 1 1 18 1 1 19 1 1 20 1 2 1 1 2 2 1 2 3 1 2 4 1 2 5 1 2 6 1 2 7 1 2 8 1 2 9 1 2 10 1 2 11 1 2 12 1 2 13 1 2 14 1 2 15 1 2 16 1 2 17 1 2 18 1 2 19 1 2 20 1 3 1 1 3 2 1 3 3 1 3 4 1 3 5 1 3...
output:
4 2 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 6 3 2 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8 4 4 2 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 10 5 4 4 2 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 12 6 4 3 4 2 4 4 4 3 4 4 4 4 4 4 4 4 4 4 14 7 5 4 4 4 2 4 4 4 4 3 4 4 4 4 4 4 4 4 16 8 6 4 4 4 4 2 4 4 4 4 4 3 4 4 4 4 4 4 18 9 6 5 4 3 4 4...
result:
wrong answer 844th numbers differ - expected: '3', found: '4'