QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#746212#9736. Kind of Bingoxbzxzn#WA 4ms5684kbC++20769b2024-11-14 13:52:012024-11-14 13:52:01

Judging History

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

  • [2024-11-14 13:52:01]
  • 评测
  • 测评结果:WA
  • 用时:4ms
  • 内存:5684kb
  • [2024-11-14 13:52:01]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long int
#define ull unsigned long long
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=1e6+5;
const int inf=1e18;
int n,m,k;
int p[maxn];
int cnt[maxn];
void solve()
{
	cin>>n>>m>>k;
	for(int i=1;i<=n*m;i++)
	{
		cin>>p[i];cnt[i]=0;
	}
	for(int i=1;i<=n*m;i++)
	{
		int lin=(p[i]/m);
		if(p[i]%m)
			lin++;
		cnt[lin]++;
		int ned=m-cnt[lin];
		int getp=min(i-cnt[lin],k);
		if(getp>=ned)
		{
			cout<<i<<'\n';return ;
		}
	}
}
signed main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cout<<fixed<<setprecision(10);
	int T=1;
    cin>>T;
    for(int i=1;i<=T;i++)
    solve();
}

详细

Test #1:

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

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
5
3

result:

ok 3 number(s): "7 5 3"

Test #2:

score: -100
Wrong Answer
time: 4ms
memory: 5612kb

input:

10000
1 9 7
8 9 1 5 3 7 4 6 2
1 8 2
7 5 1 6 4 2 3 8
1 1 0
1
1 8 3
5 7 8 3 2 1 4 6
1 10 948645336
3 10 1 6 2 8 9 5 7 4
1 1 0
1
1 10 7
5 3 10 8 1 7 4 9 6 2
1 9 6
4 8 5 7 2 6 3 1 9
1 7 1
3 5 1 6 2 7 4
1 6 6
5 3 1 2 4 6
1 1 1
1
1 2 0
1 2
1 1 1
1
1 6 3
5 6 2 4 3 1
1 5 673454194
2 3 1 4 5
1 4 1
1 4 2 3
1 ...

output:

9
8
1
8
10
1
10
9
7
6
1
2
1
6
5
4
1
7
3
3
6
8
9
10
5
6
2
10
4
2
5
7
10
1
4
1
3
9
1
2
4
3
10
5
5
2
5
6
9
5
10
1
7
5
2
2
7
1
2
9
8
9
1
6
6
2
2
1
2
6
4
6
1
2
6
4
2
3
4
7
3
4
1
6
3
5
10
7
4
1
10
3
4
2
6
10
1
8
4
9
9
10
4
6
3
3
6
2
2
6
6
10
7
7
1
3
2
7
9
3
4
4
5
6
3
7
5
6
5
5
8
2
6
6
9
7
7
10
8
1
1
10
7
...

result:

wrong answer 2044th numbers differ - expected: '5', found: '6'