QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#801196#9788. ShrecklessisWFnoya#WA 18ms3860kbC++231.2kb2024-12-06 19:20:132024-12-06 19:20:13

Judging History

This is the latest submission verdict.

  • [2024-12-06 19:20:13]
  • Judged
  • Verdict: WA
  • Time: 18ms
  • Memory: 3860kb
  • [2024-12-06 19:20:13]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std ;
void solve()
{
    int n , m ;
    cin >> n >> m ;
    vector<vector<int>> a(n , vector<int>(m , 0)) ;
    for(int i = 0 ; i < n ; i ++)
        for(int j = 0 ; j < m ; j ++)
            cin >> a[i][j] ;
    multiset<int> b ;
    for(int i = 0 ; i < n ; i ++)  b.insert(a[i][0]) ;

    for(int j = 1 ; j < m ; j ++)
    {
        if(b.empty())  break ;
        multiset<int> s ;
        for(int i = 0 ; i < n ; i ++)  s.insert(a[i][j]) ;
        int siz = b.size() ;
        for(auto u : b)
        {
            auto it = s.lower_bound(u) ;
            if(it != s.begin())
            {
                siz -= 1 ;
                it -- ;
                s.erase(it) ;
            }
        }
        b.clear() ;
        // cout << siz << "??\n" ;
        while(siz --)
        {
            auto it = s.end() ;
            it -- ;
            b.insert(*it) ;
            s.erase(it) ;
        }
        // for(auto u : b)  cout << u << ' ' ; cout << '\n' ;
    }

    if(b.empty())  cout << "YES\n" ;
    else  cout << "NO\n" ;
}
int main()
{
    std::ios::sync_with_stdio(false) , cin.tie(0) ;

    int T ;
    cin >> T ;
    while (T --)  solve() ;
    return 0 ;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3860kb

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

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: 18ms
memory: 3584kb

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]