QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#396913 | #6784. Problem Preparation | Lezy233# | WA | 3ms | 3884kb | C++20 | 605b | 2024-04-23 14:15:59 | 2024-04-23 14:16:00 |
Judging History
answer
#include <bits/stdc++.h>
using std::cin,std::cout,std::vector;
#define endl "\n"
#define yes {cout<<"Yes\n"; return;}
#define no {cout<<"No\n"; return;}
void solve()
{
int n; cin>>n;
vector<int>aa;
while(n--){
int tt; cin>>tt;
if(tt<1) continue;
aa.emplace_back(tt);
}
std::ranges::sort(aa);
n=aa.size();
if(n<10) no
if(aa[0]>1||aa[1]>1) no
for(int i=2;i<9;++i) if(aa[i]-aa[i-1]>2) no
yes
}
int main()
{
cin.tie(nullptr)->sync_with_stdio(false);
int T; cin>>T;
while(T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3836kb
input:
8 9 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 11 999 1 1 2 3 4 5 6 7 8 9 11 999 1 3 5 7 9 11 13 17 19 21 10 15 1 13 17 1 7 9 5 3 11 13 1 1 1 1 1 1 1 1 1 1 1 1 2 10 2 3 4 5 6 7 8 9 10 11 10 15 1 13 3 6 5 4 7 1 14
output:
No No Yes No Yes Yes No No
result:
ok 8 lines
Test #2:
score: -100
Wrong Answer
time: 3ms
memory: 3884kb
input:
10000 9 1 1 1 1 1 1 1 1 2 10 1 1 1 1 1 1 1 1 1 2 10 0 1 1 1 1 1 1 1000 1 1 11 1 2 3 4 5 6 7 8 9 10 11 11 1 1 2 3 4 5 6 7 8 9 10 11 -1 1 1 1 1 1 1 1 2 1 1 11 1 1 3 5 7 9 11 13 15 17 19 12 1 1 3 5 7 9 11 13 15 17 19 1000 12 1 2 3 5 7 9 11 13 15 17 19 1000 11 1 1 2 3 4 5 6 9 11 17 22 13 10 1 5 9 10 5 7...
output:
No Yes No No Yes Yes Yes Yes No No No No No No No No No No No No No Yes No Yes No No No No No No No No No No No No No No No Yes No No No No No No No Yes No No No No No Yes No No No Yes Yes No Yes No No Yes No Yes No No No No No No No No No No No Yes No No No Yes Yes No No Yes Yes No No No No No No N...
result:
wrong answer 6th lines differ - expected: 'No', found: 'Yes'