QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #804997 | #9788. Shreckless | ucup-team902# | WA | 17ms | 3984kb | C++20 | 824b | 2024-12-08 11:33:10 | 2024-12-08 11:33:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e5;
int n,m;
vector<int> a[N+5];
void solve(){
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++){
a[i].resize(m);
for(int j=0;j<m;j++)
scanf("%d",&a[i][j]);
}
multiset<int> s;
for(int i=1;i<=n;i++)
s.insert(a[i][0]);
for(int j=1;j<m;j++){
multiset<int> t;
for(int i=1;i<=n;i++){
auto it=s.upper_bound(a[i][j]);
if(it!=s.end())
s.erase(it);
else
t.insert(a[i][j]);
}
int ts=s.size();
while(t.size()>ts)
t.erase(t.begin());
s=t;
}
puts(s.size()==0?"YES":"NO");
}
int main(){
int t; scanf("%d",&t);
while(t--) solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3984kb
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: 3976kb
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: 17ms
memory: 3764kb
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]