QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#572502#9308. World CupMiniLongAC ✓0ms3672kbC++172.7kb2024-09-18 14:58:242024-09-18 14:58:25

Judging History

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

  • [2024-09-18 14:58:25]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3672kb
  • [2024-09-18 14:58:24]
  • 提交

answer

#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
int n = 32, a[40];
int main(){
    multitest(){
        _rep(i, 1, n) read(a[i]);
        int t = a[1], pos = 0;
        sort(a + 1, a + n + 1);
        _rep(i, 1, n) if(a[i] == t) pos = i;
        if(pos <= 2) puts("32");
        else if(pos <= 6) puts("16");
        else if(pos <= 13) puts("8");
        else if(pos <= 27) puts("4");
        else if(pos <= 31) puts("2");
        else puts("1");
    }
    return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

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

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: 0
Accepted
time: 0ms
memory: 3672kb

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

result:

ok 32 numbers

Test #3:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

1000
158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 628894325 731963982 822804784 450968417 430302156 982631932 161735902 880895728 923078537 707723857 189330739 910286918 802329211 404539679 303238506 317063340 492686568 773361868 125660...

output:

16
4
1
4
1
4
4
2
4
2
4
32
4
2
4
4
8
4
32
1
4
4
2
4
2
16
2
8
4
8
8
1
2
4
8
4
16
4
4
2
4
4
2
16
8
4
2
16
4
8
8
4
4
4
4
16
16
2
1
4
4
8
1
4
4
2
4
8
16
4
4
8
4
32
32
8
8
8
1
4
4
4
4
4
32
8
4
4
8
32
4
4
16
2
8
32
16
8
8
4
1
4
4
16
32
4
4
4
4
4
8
4
4
8
4
4
4
8
16
4
4
8
2
4
4
16
2
8
16
4
4
16
2
32
8
16
4
3...

result:

ok 1000 numbers

Extra Test:

score: 0
Extra Test Passed