QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #526731 | #9134. Building a Fence | ucup-team3931 | WA | 2ms | 3612kb | C++20 | 1.0kb | 2024-08-21 19:44:16 | 2024-08-21 19:44:16 |
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;
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 && (h >= s || w >= s) && 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!
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
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: 2ms
memory: 3560kb
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 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 8 4 4 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 10 5 4 4 4 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 12 6 4 3 4 4 4 4 4 3 4 4 4 4 4 4 4 4 4 4 14 7 6 4 3 4 4 4 4 4 4 3 4 4 4 4 4 4 4 4 16 8 6 4 4 3 4 4 4 4 4 4 4 3 4 4 4 4 4 4 18 9 6 6 4 3 3 4...
result:
wrong answer 23rd numbers differ - expected: '2', found: '4'