QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#565587#9308. World CupehdxbcWA 1ms3684kbC++20801b2024-09-15 21:45:452024-09-15 21:45:45

Judging History

你现在查看的是最新测评结果

  • [2024-09-15 21:45:45]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3684kb
  • [2024-09-15 21:45:45]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> PII;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
void solve() {
   int a[32] {};
   for (int i = 0; i < 32; i++) {
      cin >> a[i];
   }
   int t = a[0];
   sort(a, a + 32);
   for (int i = 0; i < 32; i++) {
      if (a[i] == t) {
         t = i + 1;
         break;
      }
   }
   if (t == 32) {
      cout << 1 << endl;
   } else if (t >= 12) {
      cout << 2 << endl;
   } else if (t >= 7) {
      cout << 8 << endl;
   } else if (t >= 3) {
      cout << 16 << endl;
   } else {
      cout << 32 << endl;
   }
}
signed main() {
   ios::sync_with_stdio(false);
   cin.tie(nullptr);
   int t = 1;
   cin >> t;
   while (t--) {
      solve();
   }
   return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 1ms
memory: 3684kb

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
32
16
16
16
16
8
8
8
8
8
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1

result:

wrong answer 12th numbers differ - expected: '8', found: '2'