QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#566473#9308. World CupsrxxxxWA 0ms3608kbC++174.4kb2024-09-16 00:13:372024-09-16 00:13:39

Judging History

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

  • [2024-09-16 00:13:39]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3608kb
  • [2024-09-16 00:13:37]
  • 提交

answer

/*                  ┌───────────────────┐
                    │ 0 error 0 warming │
                    └───────────────────┘
    ┌────────┐                              ┌────────┐
    │ Python │              ·               │ Years  │
    │        │           ·     ·            │        │
    │ Java   │         ·  Hello  ·          │ Months │
    │        │       ·             ·        │        │
    │ C++    │         ·  World! ·          │ Weeks  │
    │        │           ·     ·            │        │
    │ Line   │              ·               │  Day   │
    │        │                              │        │
    │ Line   │                              │  Day   │
    │        │                              │        │
    │  So    │                              │  No    │
    │        │                              │        │
    │ Easy   │                              │  Bug   │
    └────────┘                              └────────┘
*/
/*
 *
 *     ┏┓   ┏┓+ +
 *   ┏┛ ┻━━━┛ ┻━┓ + +               ┏┓    ┏┓+ +
 *   ┃      ┃                 ┏┛┻━━━━━━┛ ┻━━┓
 *   ┃   ━   ┃ ++ + + +         ┃       ┃++ + + +
 *   ████━████   ┃+                 ┃   ━    ┃
 *   ┃      ┃ +                ┃ >   < ┃
 *   ┃   ┻  ┃                  ┃        ┃
 *   ┃      ┃ + +              ┃... ⌒ ... ┃
 *   ┗━┓    ┏━┛                  ┃        ┃
 *    ┃   ┃               ┗━┓   ┏━━━┛     
 *    ┃   ┃ + + + +              ┃   ┃  + + + +
 *    ┃   ┃                      ┃   ┃
 *    ┃   ┃ +  神兽保佑           ┃   ┃+  神兽保佑
 *    ┃   ┃    代码无bug          ┃   ┃   cf不被hack
 *    ┃   ┃  +              ┃   ┃   ++   +   
 *    ┃    ┗━━━┓ +,,            ┃   ┗━━━┓
 *    ┃       ┣┓ +++            ┃      ┣┓  ++
 *    ┃       ┏┛                ┃      ┏┛  ++++
 *    ┗┓┓ ┏━━━┳┓ ┏┛ + + + +         ┗┓ ┏━━━┳┓ ┏┛
 *     ┃┫┫   ┃┫┫                   ┃┫┫   ┃┫┫        +++
 *     ┗┻┛   ┗┻┛+ + + +            ┗┻┛   ┗┻┛
 *
 */

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define fore(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define foree(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define ford(i, a, b) for (int(i) = (a); (i) > (b); (i)--)
#define forde(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b)
{
    return a * b / gcd(a, b);
}
ll qpow(ll a, ll k, ll p)
{
    ll res = 1 % p;
    while (k)
    {
        if (k & 1)
            res = (ll)res * a % p;
        a = (ll)a * a % p;
        k >>= 1;
    }
    return res;
}
ll _;
ll n, m, k, c;
ll a[0x3f3f3f];
ll l, r;
ll ans = 0;
bool flag;
void solve()
{
    cin >> c;
    ll rank = 0;
    for (ll i = 1; i < 32; i++)
    {
        cin >> a[i];
        if (a[i] < c)
            rank++;
    }
    if (rank >= 6)
        ans = 1;
    else if (rank >= 5)
        ans = 2;
    else if (rank >= 4)
        ans = 4;
    else if (rank >= 3)
        ans = 8;
    else if (rank >= 2)
        ans = 16;
    else
        ans = 32;
    cout << ans;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    _ = 1;
    cin >> _;
    while (_--)
    {
        solve();
        cout << '\n'; // 这里记得手动添加换行的转义字符
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3608kb

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
8
4
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

result:

wrong answer 4th numbers differ - expected: '16', found: '8'