QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#234417 | #4184. Amusement Arcade | Fyind# | AC ✓ | 1ms | 3476kb | C++17 | 608b | 2023-11-01 17:01:11 | 2023-11-01 17:01:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll x;
cin >> x;
if (x == 1) {
cout << "1\n";
return 0;
}
x = (x + 1) / 2 + 1;
vector<ll> f;
set<ll> s;
f.push_back(1);
f.push_back(2);
s.insert(1);
s.insert(2);
while (*f.rbegin() * 2 - 1 <= x)
f.push_back(*f.rbegin() * 2 - 1), s.insert(*f.rbegin());
for (ll xx : f)
if (s.find(x - xx) != s.end()) {
cout << xx * 2 - 1 << '\n';
return 0;
}
cout << "impossible\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3384kb
input:
7
output:
3
result:
ok
Test #2:
score: 0
Accepted
time: 1ms
memory: 3476kb
input:
15
output:
impossible
result:
ok
Test #3:
score: 0
Accepted
time: 1ms
memory: 3364kb
input:
19
output:
3
result:
ok
Test #4:
score: 0
Accepted
time: 1ms
memory: 3360kb
input:
2049
output:
1
result:
ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3364kb
input:
32769
output:
1
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3420kb
input:
536870913
output:
1
result:
ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3364kb
input:
35184372088833
output:
1
result:
ok
Test #8:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
2251799813685249
output:
1
result:
ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3444kb
input:
576460752303423489
output:
1
result:
ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3400kb
input:
1027
output:
3
result:
ok
Test #11:
score: 0
Accepted
time: 0ms
memory: 3416kb
input:
2081
output:
33
result:
ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3388kb
input:
34393292801
output:
33554433
result:
ok
Test #13:
score: 0
Accepted
time: 1ms
memory: 3360kb
input:
1
output:
1
result:
ok
Test #14:
score: 0
Accepted
time: 1ms
memory: 3468kb
input:
281543696187393
output:
68719476737
result:
ok
Test #15:
score: 0
Accepted
time: 1ms
memory: 3396kb
input:
576460752303423491
output:
3
result:
ok
Test #16:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
576460752336977921
output:
33554433
result:
ok
Test #17:
score: 0
Accepted
time: 1ms
memory: 3372kb
input:
576461851815051265
output:
1099511627777
result:
ok
Test #18:
score: 0
Accepted
time: 1ms
memory: 3472kb
input:
864691128455135233
output:
288230376151711745
result:
ok
Test #19:
score: 0
Accepted
time: 0ms
memory: 3376kb
input:
635
output:
impossible
result:
ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3476kb
input:
4537995
output:
impossible
result:
ok
Test #21:
score: 0
Accepted
time: 1ms
memory: 3444kb
input:
4795018843
output:
impossible
result:
ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3392kb
input:
5268828738869
output:
impossible
result:
ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3368kb
input:
3859135424551273
output:
impossible
result:
ok
Test #24:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
3
output:
1
result:
ok
Test #25:
score: 0
Accepted
time: 0ms
memory: 3360kb
input:
63913510461995523
output:
impossible
result:
ok
Test #26:
score: 0
Accepted
time: 0ms
memory: 3380kb
input:
341683697045680425
output:
impossible
result:
ok
Test #27:
score: 0
Accepted
time: 1ms
memory: 3424kb
input:
999999999999999999
output:
impossible
result:
ok
Test #28:
score: 0
Accepted
time: 0ms
memory: 3392kb
input:
5
output:
1
result:
ok
Test #29:
score: 0
Accepted
time: 0ms
memory: 3388kb
input:
9
output:
1
result:
ok
Test #30:
score: 0
Accepted
time: 0ms
memory: 3440kb
input:
11
output:
3
result:
ok
Test #31:
score: 0
Accepted
time: 1ms
memory: 3440kb
input:
13
output:
5
result:
ok
Test #32:
score: 0
Accepted
time: 1ms
memory: 3360kb
input:
17
output:
1
result:
ok