QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#526724 | #9134. Building a Fence | ucup-team3931# | WA | 0ms | 3648kb | C++20 | 1.1kb | 2024-08-21 19:41:18 | 2024-08-21 19:41:20 |
Judging History
answer
#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) static_cast<int>((v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;
using vi = vector<int>;
#endif
int main () {
ios::sync_with_stdio(0), cin.tie(0);
int T;
cin >> T;
while (T--) {
int h, w, s;
cin >> h >> w >> s;
if (h <= s && w <= s) {
cout << "4\n";
continue;
}
int x = h % s, y = w % s;
int ns = (h + w - x - y) / s * 2 + 4;
if (x == 0) {
ns -= 2;
}
if (y == 0) {
ns -= 2;
}
if (x && y && x + y <= s) {
ns -= 2;
if (s >= 2 * (x + y)) {
ns -= 1;
}
} else {
if (s % 2 == 0) {
if (x == s / 2) {
ns -= 1;
}
if (y == s / 2) {
ns -= 1;
}
}
}
cout << ns << '\n';
}
}
// I love WHQ!
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3648kb
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 4 4 10 4 8 5
result:
wrong answer 2nd numbers differ - expected: '2', found: '4'