QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#785174#9736. Kind of BingoProaesWA 0ms3588kbC++17785b2024-11-26 17:04:062024-11-26 17:04:07

Judging History

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

  • [2024-11-26 17:04:07]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3588kb
  • [2024-11-26 17:04:06]
  • 提交

answer

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;
void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> p(n * m + 10);
    vector<vector<int>> e(n + 1);
    for (int i = 1; i <= n * m; i++)
    {
        cin >> p[i];
        e[p[i] / m].push_back(i);
    }

    int ans = n * m;
    for (int i = 0; i < n; i++)
    {
        if (m - k - 1 < 0)
            ans = min(ans, m);
        else
            ans = min(ans, max(m, e[i][max(0, m - k - 1)]));
    }
    cout << ans << endl;
}

int main()
{
#ifdef x3ea
    freopen("in.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    for (; _; _--)
        solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
3 5 2
1 4 13 6 8 11 14 2 7 10 3 15 9 5 12
2 3 0
1 6 4 3 5 2
2 3 1000000000
1 2 3 4 5 6

output:

7
3
3

result:

wrong answer 2nd numbers differ - expected: '5', found: '3'