QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#572940#9308. World CupTrspntWA 0ms3580kbC++23816b2024-09-18 16:53:462024-09-18 16:53:52

Judging History

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

  • [2024-09-18 16:53:52]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3580kb
  • [2024-09-18 16:53:46]
  • 提交

answer

#include <bits/stdc++.h>

#define int long long

using namespace std;
typedef pair<int,int> PII;
const int N = 1e3+10,mod = 1e9+7,M = 4e3+10,INF = 1e10;

void solve()
{
    vector<int>a(32);
    for(int i=0;i<32;i++)cin>>a[i];
    int res=a[0];
    sort(a.begin(),a.end());
    int idx;
    for(int i=0;i<32;i++)
    {
        if(a[i]==res)
        {
            idx=i+1;
            break;
        }
    }
    if(idx<=2)cout<<32<<"\n";
    else if(idx<7)cout<<16<<"\n";
    else if(idx>=7&&idx<15)cout<<8<<"\n";
    else if(idx>=15&&idx<31)cout<<4<<"\n";
    else if(idx>=31&&idx<32)cout<<2<<"\n";
    else cout<<1<<"\n";
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T=1;
    cin>>T;
    //init();
    while(T--)solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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

result:

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