QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#425964 | #6677. Puzzle: Sashigane | xorzj# | WA | 1ms | 3612kb | C++17 | 1.3kb | 2024-05-30 19:42:33 | 2024-05-30 19:42:35 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define ALL(x) (x).begin(), (x).end()
typedef double db;
const db eps = 1e-8;
void solve()
{
int n, i, j;
cin >> n >> i >> j;
int u = i, d = i;
int l = j, r = j;
cout << "Yes" << endl;
cout << n - 1 << endl;
for (int k = 1; k < n; k++)
{
if (u - 1 >= 1 && (r + 1) <= n)
{
u -= 1;
r += 1;
cout << u << " " << r << " " << (d - u + 1) << " " << -(r - l + 1) << endl;
}
else if (u - 1 >= 1 && l - 1 >= 1)
{
u -= 1;
l -= 1;
cout << u << " " << l << " " << (d - u + 1) << " " << (r - l + 1) << endl;
}
else if (d + 1 <= n && l - 1 >= 1)
{
d += 1;
l -= 1;
cout << d << " " << l << " " << -(d - u + 1) << " " << (r - l + 1) << endl;
}
else
{
d += 1;
r += 1;
cout << d << " " << r << " " << -(d - u + 1) << " " << -(r - l + 1) << endl;
}
}
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
}
详细
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3612kb
input:
5 3 4
output:
Yes 4 2 5 2 -2 1 3 3 3 4 2 -4 4 5 1 -5 5
result:
wrong answer L shape #2 out of bounds. (test case 1)