QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#438600#8008. Fortune Wheelreal_sigma_team#WA 20ms4832kbC++171.7kb2024-06-10 20:14:322024-06-10 20:14:33

Judging History

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

  • [2024-07-30 15:38:33]
  • hack成功,自动添加数据
  • (/hack/759)
  • [2024-07-10 08:02:33]
  • hack成功,自动添加数据
  • (/hack/730)
  • [2024-06-10 20:14:33]
  • 评测
  • 测评结果:WA
  • 用时:20ms
  • 内存:4832kb
  • [2024-06-10 20:14:32]
  • 提交

answer

#include <bits/stdc++.h>
#include <immintrin.h>

using namespace std;

using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

mt19937 mt(123);

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    cout << fixed << setprecision(30);
    init();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

void solve() {
    int n, x, k;
    cin >> n >> x >> k;
    vector<int> go(k);
    for (int i = 0; i < k; i++) {
        cin >> go[i];
    }
    vector<int> dist(n, 2 * n);
    dist[0] = 0;
    queue<int> q;
    q.push(0);
    while (!q.empty()) {
        int s = q.front();
        q.pop();
        for (int i : go) {
            if (dist[(s - i + n) % n] == 2 * n) {
                q.push((s - i + n) % n);
                dist[(s - i + n) % n] = dist[s] + 1;
            }
        }
    }
    ll c1 = 0;
    int c = 0;
    vector<int> count(2 * n + 1, 0);
    for (int i = 0; i < n; i++) {
        c1 += dist[i];
        count[dist[i]]++;
    }
    ll sp = -1, sq = -1;
    for (int val = 2 * n; val > 0; val--) {
        c1 -= val * count[val];
        c += count[val];
        ll s_p = (c1 + n) * n;
        ll s_q = (n - c) * n;
        if (s_p <= val * s_q && s_p >= (val - 1) * s_q) {
            sp = s_p;
            sq = s_q;
            break;
        }
    }
    assert(sp != -1 && sq != -1);
    ll gc = __gcd(sp, sq);
    sp /= gc;
    sq /= gc;
    if (dist[x] * sq <= sp) {
        cout << dist[x] << " 1\n";
    } else {
        cout << sp << ' ' << sq << '\n';
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3520kb

input:

6 3 2
2 4

output:

8 3

result:

ok 2 number(s): "8 3"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3768kb

input:

5 4 1
1

output:

1 1

result:

ok 2 number(s): "1 1"

Test #3:

score: 0
Accepted
time: 20ms
memory: 4832kb

input:

99999 65238 100
64714 45675 36156 13116 93455 22785 10977 60219 14981 25839 83709 80404 41400 12469 31530 65521 35436 20326 96792 50699 27522 98233 26187 12509 90992 72693 83919 74145 80892 68422 38333 33497 89154 88403 77492 4570 3908 59194 3482 89871 96330 45114 5555 73987 95832 476 949 74649 2084...

output:

3 1

result:

ok 2 number(s): "3 1"

Test #4:

score: 0
Accepted
time: 1ms
memory: 3740kb

input:

10000 23 7
9594 8998 9330 6851 1662 6719 583

output:

42726 4805

result:

ok 2 number(s): "42726 4805"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3528kb

input:

100 3 100
7 68 28 98 19 32 90 79 92 40 96 30 95 91 71 15 33 18 69 1 61 43 5 75 73 64 58 100 88 20 99 37 17 22 82 67 70 55 47 80 66 12 4 24 26 54 74 57 21 77 86 89 83 29 46 31 2 16 49 48 25 93 52 9 85 84 42 39 8 65 10 45 63 87 78 60 23 14 34 59 81 38 41 76 3 13 27 36 35 51 44 62 53 94 6 50 11 97 72 56

output:

1 1

result:

ok 2 number(s): "1 1"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3600kb

input:

100 93 4
63 58 3 89

output:

19 4

result:

ok 2 number(s): "19 4"

Test #7:

score: -100
Wrong Answer
time: 2ms
memory: 4272kb

input:

75057 45721 3
10861 27551 14278

output:

78 1

result:

wrong answer 1st numbers differ - expected: '32797', found: '78'