QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#571131#9308. World Cupxed_starry_skyWA 0ms3580kbC++231.2kb2024-09-17 20:41:072024-09-17 20:41:08

Judging History

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

  • [2024-09-17 20:41:08]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3580kb
  • [2024-09-17 20:41:07]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;


#pragma GCC optimize(2)
#define debug(a) cout<<#a<<'='<<a<<endl
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repp(i,a,b) for(int i=a ;i<=b;i++)
#define per(i,b,a) for(int i=b;i>a;i--)
#define perr(i,b,a) for(int i=b;i>=a;i--)
#define pii pair<int,int>
#define mm memset
#define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define INF 0x7fffffff

const double EPS =1e-8;
const int N=2e5+2;

pii a[N];

void fun(){
	for(int i = 1 ; i <= 32 ; ++ i)
	{
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a + 1, a + 32 + 1);
	int p;
	for(int i = 1 ; i <= 32 ; ++ i)
	{
		if(a[i].second == 1)
		p = i;
	}
	p = 32 - p + 1;
	if(p > 16)
	{
		cout << 32 << endl;
	}
	else if(p > 8)
	{
		cout << 16 << endl;
	}
	else if(p > 4)
	{
		cout << 8 << endl;
	}
	else if(p > 2)
	{
		cout<< 4 << endl;
	}
	else if(p>1)
    {
        cout<<2<<endl;
    }
	else cout << p << endl;
}

signed main(){

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

	int t=1 ;
	cin>>t;

	while(t--){
		fun();
	}



}

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

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

result:

wrong answer 3rd numbers differ - expected: '16', found: '32'