QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#773443	#9788. Shreckless	ucup-team3555^#	WA	13ms	3832kb	C++20	867b	2024-11-23 08:50:27	2024-11-23 08:50:28

Judging History

This is the latest submission verdict.

[2024-11-23 08:50:28]
Judged

Verdict: WA
Time: 13ms
Memory: 3832kb

Show

[2024-11-23 08:50:27]
Submitted

answer

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=2e5+3;
int n,m;
vector<int>a[N];
void Solve()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)a[i].resize(m+1);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)cin>>a[i][j];
	vector<int>now(n+1,0),nb(n+1,0);nb[0]=1;
	for(int i=1;i<=n;i++)now[i]=a[i][1];
	sort(now.begin(),now.end());
	for(int i=1;i<=n;i++)a[i][1]=now[i];
	for(int t=2;t<=m;t++)
	{
		for(int i=1;i<=n;i++)now[i]=a[i][t];
		sort(now.begin(),now.end());vector<int>cur(n+1,0);
		for(int i=1,hd=1,tl=n;i<=n;i++)
		{
			if(nb[i]||a[i][t-1]<=now[hd])cur[i]=now[tl--];
			else nb[i]=1,cur[i]=now[hd++];
		}
		for(int i=1;i<=n;i++)a[i][t]=cur[i];
	}
	puts(!count(nb.begin(),nb.end(),0)?"YES":"NO");
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;cin>>T;
	while(T--)Solve();
	return 0; 
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3568kb

input:

output:

YES
NO
YES

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: 0

Accepted

time: 1ms

memory: 3832kb

input:

output:

YES
NO
YES

result:

ok 3 token(s): yes count is 2, no count is 1

Test #3:

score: -100

Wrong Answer

time: 13ms

memory: 3644kb

input:

output:

NO
NO
YES
NO
NO
YES
YES
YES
NO
NO
NO
NO
YES
YES
YES
YES
NO
NO
YES
NO
NO
NO
YES
NO
YES
YES
YES
YES
NO
NO
NO
YES
NO
YES
NO
NO
NO
NO
YES
YES
NO
NO
YES
NO
YES
NO
NO
YES
YES
YES
NO
NO
NO
YES
NO
YES
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
NO
YES
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
YES
YES
NO
NO
NO
...

result:

wrong answer expected YES, found NO [2nd token]