QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#773453#9788. Shrecklessucup-team3555#WA 14ms3884kbC++201009b2024-11-23 08:53:262024-11-23 08:53:29

Judging History

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

  • [2024-11-23 08:53:29]
  • 评测
  • 测评结果:WA
  • 用时:14ms
  • 内存:3884kb
  • [2024-11-23 08:53:26]
  • 提交

answer

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

typedef long long ll;
const int N=2e5+3;
int n,m;
vector<int>a[N];
bool Chk()
{
	if(m==1)return 0;
	for(int i=1;i<=n;i++)
	{
		int mk=0;
		for(int j=1;j<m;j++)mk+=a[i][j]<=a[i][j+1];
		if(mk==m-1)return 0;
	}
	return 1;
}
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(Chk()?"YES":"NO");
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T;cin>>T;
	while(T--)Solve();
	return 0; 
}

詳細信息

Test #1:

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

input:

3
2 2
69 69
2024 42
3 3
1 1 1
1 1 1
2 2 2
3 4
1 1 1 1
1 1 1 1
2 2 2 2

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: 3880kb

input:

3
2 2
69 69
2024 42
3 3
1 1 1
1 1 1
2 2 2
3 4
1 1 1 1
1 1 1 1
2 2 2 2

output:

YES
NO
YES

result:

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

Test #3:

score: -100
Wrong Answer
time: 14ms
memory: 3884kb

input:

20000
6 2
12 4
8 24
2 10
1 22
3 15
18 20
3 3
3 8 18
2 17 15
13 4 6
3 3
7 17 15
8 6 3
18 13 9
3 3
2 3 14
1 7 17
4 6 13
3 3
6 10 14
3 9 13
1 7 15
2 4
1 3 16 14
6 10 4 2
3 3
3 2 17
7 11 13
16 5 18
2 3
2 3 6
4 1 5
2 4
4 6 13 14
2 11 12 16
3 3
2 8 12
4 9 17
5 7 18
3 2
5 10
8 9
1 6
2 2
2 4
1 3
2 3
12 6 1
...

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]