#918375 (C++14) No.2493 K-th in L2 with L1

• 問題: No.2493 K-th in L2 with L1
• ユーザー: pmankirai
• 提出日時: 2023-10-06 21:46:13
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 4 ms / 2,000 ms
• コード長: 1,905 bytes
• コンパイル時間: 1,705 ms
• コンパイル使用メモリ: 174,780 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-26 15:56:29
• 合計ジャッジ時間: 2,198 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 1
other	AC * 4

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;
// typedef modint998244353 mint;
void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}
template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/*--------------------------------------------------*/
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int INF = 1e9;
const ll LINF = 1e18;
const int MAX = 1e5;
void solve() {
    int q;
    cin >> q;
    rep(qi, q) {
        int d, k;
        cin >> d >> k;
        V<PP> v;
        for (int x = -d; x <= d; x++) {
            for (int y = -d; y <= d; y++) {
                if (abs(x) + abs(y) != d) continue;
                v.eb(x * x + y * y, P(x, y));
            }
        }
        if (sz(v) < k) {
            cout << "No\n";
            continue;
        }
        cout << "Yes\n";
        sort(all(v));
        cout << v[k - 1].se.fi << " " << v[k - 1].se.se << "\n";
    }
}
int main() {
    speedUpIO();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        // cout << solve() << "\n";
        // cout << (solve() ? "Yes" : "No") << "\n";
        // cout << fixed << setprecision(15) << solve() << "\n";
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX