QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#781243#9788. ShrecklessGenshinImpactShutdown#WA 19ms3656kbC++141.1kb2024-11-25 15:23:342024-11-25 15:23:35

Judging History

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

  • [2024-11-25 15:23:35]
  • 评测
  • 测评结果:WA
  • 用时:19ms
  • 内存:3656kb
  • [2024-11-25 15:23:34]
  • 提交

answer

#include<bits/stdc++.h>
#define All(x) x.begin(),x.end()
using namespace std;
using ull=unsigned long long;
using ll=long long;
using bint=__int128;
using ld=long double;
using pii=pair<int,int>;
using vi=vector<int>;
int n,m;vector<vi> a;
multiset<int> s0,s1;
void solve()
{
    cin>>n>>m;a.resize(m+5);
    for(int i=1;i<=n;i++)
    {
        int x;for(int j=1;j<=m;j++)
        cin>>x,a[j].push_back(x);
    }swap(n,m);s0.clear(),s1.clear();
    for(int j=0;j<m;j++)s0.insert(a[1][j]);
    for(int i=2;i<=n;i++)
    {
        if(s0.size()==0)break;
        for(int j=0;j<m;j++)
        {
            const int vl=a[i][j];
            auto it=s0.upper_bound(vl);
            if(it==s0.end())s1.insert(vl);
            else s0.erase(it);
        }int sz=s0.size();s0.clear();
        for(int c=1;c<=sz;c++)
        {
            auto it=s1.rbegin();
            s0.insert(*it);
            s1.erase(s1.find(*it));
        }s1.clear();
    }if(s0.size()==0)cout<<"Yes\n";else cout<<"No\n";
    a.clear();a.shrink_to_fit();
}
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: 0ms
memory: 3652kb

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: 0ms
memory: 3656kb

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: 19ms
memory: 3652kb

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
Yes
No
No
Yes
No
Yes
No
No
Yes
No
Yes
Yes
No
No
Yes
No
Yes
No
No
Yes
Yes
Yes
No
No
No
Yes
Yes
Yes
No
No
No
Yes
No
No
Yes
No
No
No
Yes
Yes
Yes
Yes
No
No
Yes
No
No
No
No
No
Yes
Yes
Yes
No
No
Yes
Yes
No
No...

result:

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