QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#589664 | #9313. Make Max | mikulove | WA | 1ms | 3640kb | C++20 | 923b | 2024-09-25 19:26:38 | 2024-09-25 19:26:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define wil() int T;cin>>T;while(T--)
#define per(i,l,r) for(int i=l;i<=r;i++)
#define rep(i,r,l) for(int i=r;i>=l;i--)
#define all(it) it.begin(),it.end()
#define rall(it) it.rbegin(),it.rend()
#define PII pair<int,int>
int mod = 998244353;
#define inf 0x3f3f3f3f
const int N = 2e2 + 5;
int a[N],b[N],c[N];
int n, m, q;
void sol(){
cin >> n;
while (n--) {
int ans = 0;
per(i,0,31){
cin>>a[i];
if(a[i]<=a[0]) ans++;
}
if (ans == 32) cout<<"1"<<endl;
else if (ans >= 28) cout<<"2"<<endl;
else if (ans >= 14) cout<<"4"<<endl;
else if (ans >= 7) cout<<"8"<<endl;
else if (ans >= 3) cout<<"16"<<endl;
else cout<<"32"<<endl;
}
}
signed main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
// wil()
sol();
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3640kb
input:
4 2 1 2 2 2 2 7 1 1 1 2 2 2 2 3 1 2 3
output:
2 2 2 2
result:
wrong answer 1st numbers differ - expected: '1', found: '2'