QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#177845#6510. Best Carry Player 3mendicillin2#WA 17ms3728kbC++171.8kb2023-09-13 14:38:062023-09-13 14:38:08

Judging History

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

  • [2023-09-13 14:38:08]
  • 评测
  • 测评结果:WA
  • 用时:17ms
  • 内存:3728kb
  • [2023-09-13 14:38:06]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;

#define int ll

template <class F>
struct ycr {
	F f;
	
	template <class T>
	explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... Args>
	decltype(auto) operator()(Args&&... args) {
		return f(ref(*this), forward<Args>(args)...);
	}
};
template <class F>
decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

signed main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);
	int T;
	cin>>T;
	int x,y,k;
	while(T--)
	{
		cin>>x>>y>>k;
		if(x>y) swap(x,y);
		if(k==0)
		{
			cout<<y-x<<"\n";
			continue;
		}
		if(x==y)
		{
			cout<<"0"<<"\n";
			continue;
		}
		int now=1;
		while(now<=k) now*=2;
		if(k!=now-1)
		{
			int w=x^y;
			if(w<=k)
			{
				cout<<"1"<<"\n";
				continue;
			}
			int nxt=(x+now-1)/now*now;
			if(y<nxt)
			{
				cout<<"2"<<"\n";
				continue;
			}
			int ans=0;
			if(nxt!=x)
			{
				if(nxt-1==x) x++, ans++;
				else if(((nxt-1)^x)<=k) ans+=2, x=nxt;
				else ans+=3, x=nxt;
			}
			int res=(y-x)/now;
			ans+=res*3;
			x+=res*now;
			if(x!=y)
			{
				if((x^y)<=k) ans++;
				else ans+=2;
			} 
			cout<<ans<<"\n";
		}
		else
		{
			int w=x^y;
			if(w<=k)
			{
				cout<<"1"<<"\n";
				continue;
			}
			int nxt=(x+now-1)/now*now;
			if(y<nxt)
			{
				cout<<"2"<<"\n";
				continue;
			}
			int ans=0;
			if(nxt!=x)
			{
				if(nxt-1==x) x++, ans++;
				else if(((nxt-1)^x)<=k) ans+=2, x=nxt;
				else ans+=3, x=nxt;
			}
			int res=(y-x)/now;
			ans+=res*2;
			x+=res*now;
			if(x!=y)
			{
				if((x^y)<=k) ans++;
				else ans+=2;
			} 
			cout<<ans<<"\n";
		}
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 17ms
memory: 3628kb

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 809th numbers differ - expected: '1', found: '2'