QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#195861#6510. Best Carry Player 3whyWA 9ms1516kbC++171.1kb2023-10-01 08:35:542023-10-01 08:35:56

Judging History

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

  • [2023-10-01 08:35:56]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:1516kb
  • [2023-10-01 08:35:54]
  • 提交

answer

#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
using namespace std;

template<typename T>
inline void read(T &x)
{
    T k=1;char ch=getchar();x=0;
    while(ch<'0'||ch>'9'){if(ch=='-') k=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    x*=k;
}

typedef long long ll;
#define int ll
typedef pair<int,int> pii;
const int N=1e5+86;

void solve()
{
    int x,y,k;
    read(x),read(y),read(k);
    if(y>x) swap(x,y);
    if(!k)
    {
        printf("%lld\n",x-y);
        return;
    }
    int bit=0;
    while((1<<bit)<=k) bit++;
    int p=(x>>bit)-(y>>bit),sum=0;//printf("%lld\n",p);
    if((x&((1<<bit)-1))>k) sum=3;
    else if(x&((1<<bit)-1)) sum=2;
    else sum=1;
    if((((1<<bit)-1)^(((1<<bit)-1)&y))>k) sum+=2;
    else if(((1<<bit)-1)^(((1<<bit)-1)&y)) sum+=1;
    else sum+=0;
    p--;
    printf("%lld\n",sum+p*(3-(k==((1<<bit)-1))));
}

signed main()
{
    int T;
    read(T);
    while(T--) solve();
    return 0;
}

詳細信息

Test #1:

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

input:

8
4 5 0
5 8 3
9 2 6
15 28 5
97 47 8
164 275 38
114514 1919 810
0 1152921504606846975 1

output:

1
2
3
5
11
6
331
1152921504606846975

result:

ok 8 numbers

Test #2:

score: -100
Wrong Answer
time: 9ms
memory: 1516kb

input:

100000
84 318 6
54 226 7
92 33 0
39 54 5
76 79 7
247 110 0
211 90 0
4 430 3
230 17 1
491 93 5
196 117 7
137 29 2
76 490 6
422 43 7
277 26 4
159 43 1
67 37 5
17 2 5
113 176 7
85 473 0
68 217 7
275 8 7
124 34 1
30 66 0
80 149 3
103 149 6
84 354 1
27 342 7
94 114 1
69 125 1
72 48 7
361 8 7
285 82 1
74 ...

output:

87
45
59
6
1
137
121
213
213
150
21
81
156
95
95
116
12
6
16
388
39
67
90
36
35
17
270
79
20
56
6
89
203
108
26
15
157
98
111
389
174
123
59
289
78
17
21
36
275
191
17
102
60
93
100
11
6
79
44
63
91
60
22
109
11
3
10
67
11
85
207
47
39
83
156
189
107
27
81
247
81
335
33
144
11
50
54
347
233
175
30
7...

result:

wrong answer 220th numbers differ - expected: '1', found: '0'