QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#565905 | #9308. World Cup | green__hand | WA | 0ms | 3612kb | C++20 | 1.2kb | 2024-09-15 22:34:52 | 2024-09-15 22:34:52 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef long long i64;
typedef pair<int, int> PII;
const int N = 2e5 + 10, p = 998244353;
int lowbit(int x) { return x & (-x); }
int fac26[N];
int qmi(int a, int b, int p) {
int res = 1;
while (b) {
if (b & 1) res = res * a % p;
a = a * a % p;
b >>= 1;
}
return res;
}
bool cmp(int x, int y) { return x > y; }
void solve() {
int n, ans; cin >> n;
vector<PII> a(32);
for (int i = 0; i < 32; i++) cin >> a[i].first, a[i].second = i + 1;
sort(a.rbegin(), a.rend());
// for (int i = 0; i < 32; i++) {
// cout << a[i].first << ' ' << a[i].second << '\n';
// }
int i = 0;
for (; i < 32; i++) {
if (a[i].second == 1) break;
}
if (i <= 1) ans = 1;
else if (i <= 5) ans = 2;
else if (i <= 19) ans = 4;
else if (i <= 26) ans = 8;
else if (i <= 30) ans = 16;
else if (i == 31) ans = 32;
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3544kb
input:
1 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3612kb
input:
32 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...
output:
32 16 16 16 16 8 8 8 8 8 8 8 4 4 4 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 1 32
result:
wrong answer 2nd numbers differ - expected: '32', found: '16'