QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#568315#9308. World CupliuhuaqingWA 0ms3568kbC++171.4kb2024-09-16 16:01:412024-09-16 16:01:41

Judging History

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

  • [2024-09-16 16:01:41]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3568kb
  • [2024-09-16 16:01:41]
  • 提交

answer

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<tuple>
#include<deque>
#include<stack>
#include<sstream>
#include<limits.h>
using namespace std;
#define x64 long long
#define ull unsigned long long
#define __md ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define mem(h,x) memset(h,x,sizeof h);
#define py cout<<"YES"<<endl;
#define pn cout<<"NO"<<endl;
#define PII pair<int,int>
#define PCS pair<char,int>
#define PSI pair<string,int>
#define PBS pair<bool,string>
#define PSS pair<string,string> 
int gcd(int a, int b){ return b?gcd(b, a%b):a;}
int lcm(int a, int b){ return a*b/gcd(a,b);}
int ne[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
//int nefire[8][2]={{0,1},{1,0},{0,-1},{-1,0},{-1,-1},{-1,1},{1,-1},{1,1}};
constexpr int N=1e4+5,mod=1e9+7;
map<int,int> mp;
void solve(){
    int n=32;
    int a[n];
    for(int i=0;i<n;i++) cin>>a[i];
    if(a[0]<2)
        cout<<"32\n";
    else if(a[0]<4)
        cout<<"16\n";
    else if(a[0]<8)
        cout<<"8\n";
    else if(a[0]<16)
        cout<<"4\n";
    else if(a[0]<32)
        cout<<"2\n";
    else cout<<"1\n";
}
int main()
{
    __md
   int t;cin>>t;
   while(t--){
      solve();
   }
}

詳細信息

Test #1:

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

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

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

result:

wrong answer 2nd numbers differ - expected: '32', found: '16'