QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#425936#6677. Puzzle: Sashiganexorzj#WA 0ms3656kbC++171.3kb2024-05-30 19:19:382024-05-30 19:19:38

Judging History

你现在查看的是最新测评结果

  • [2024-05-30 19:19:38]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3656kb
  • [2024-05-30 19:19:38]
  • 提交

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();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3656kb

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 #1 out of bounds. (test case 1)