Submission #1314459
Source Code Expand
#include <cstdio> long long ex2[63]; long long A,B; long long askzero(long long minv,int dig) { //(minv), ... , 111..1 at least one minv=(minv&(ex2[dig]-1)); long long ret=1; for(int i=dig-1;i>=0;i--) { if(minv&ex2[i]) { } else { ret+=ex2[i]; } } if(minv==0) ret--; return ret; } int main() { ex2[0]=1; for(int i=1;i<62;i++) ex2[i]=ex2[i-1]*2; scanf("%lld%lld",&A,&B); if(A==B) { printf("1\n"); return 0; } long long sol=0; for(int dig=61;dig>=0;dig--) { if((A&ex2[dig])!=(B&ex2[dig])) { if(dig==0) { printf("2\n"); return 0; } //printf("%lld %lld %d\n",A,B,dig); //different //dig==0: continue sol+=askzero(A&(ex2[dig]-1),dig); if((A&(ex2[dig]-1))==0) sol++; //dig==1 int dig2=dig-1; while(1) { if(B&ex2[dig2]) break; dig2--; if(dig2==-1) break; } A=(A&(ex2[dig]-1)); if(dig2<0) { sol+=askzero(A,dig)+1; } else if(A<=ex2[dig2+1]-1) { sol+=ex2[dig]; } else { sol+=askzero(A,dig); sol+=ex2[dig2+1]; } //sol+=ex2[dig2+1]*(askzero((A>>(dig2+1)),dig-dig2-1)+1); break; } } printf("%lld\n",sol); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - A or...or B Problem |
User | phidnight |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1188 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:21:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld",&A,&B); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 900 / 900 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 0 ms | 128 KB |
02.txt | AC | 0 ms | 128 KB |
03.txt | AC | 0 ms | 128 KB |
04.txt | AC | 0 ms | 128 KB |
05.txt | AC | 0 ms | 128 KB |
06.txt | AC | 0 ms | 128 KB |
07.txt | AC | 0 ms | 128 KB |
08.txt | AC | 0 ms | 128 KB |
09.txt | AC | 0 ms | 128 KB |
10.txt | AC | 0 ms | 128 KB |
11.txt | AC | 0 ms | 128 KB |
12.txt | AC | 1 ms | 128 KB |
13.txt | AC | 1 ms | 128 KB |
14.txt | AC | 0 ms | 128 KB |
15.txt | AC | 0 ms | 128 KB |
16.txt | AC | 0 ms | 128 KB |
17.txt | AC | 0 ms | 128 KB |
18.txt | AC | 0 ms | 128 KB |
19.txt | AC | 0 ms | 128 KB |
20.txt | AC | 0 ms | 128 KB |
21.txt | AC | 0 ms | 128 KB |
22.txt | AC | 0 ms | 128 KB |
23.txt | AC | 0 ms | 128 KB |
24.txt | AC | 1 ms | 128 KB |
25.txt | AC | 1 ms | 128 KB |
26.txt | AC | 1 ms | 128 KB |
27.txt | AC | 1 ms | 128 KB |
28.txt | AC | 0 ms | 128 KB |
29.txt | AC | 1 ms | 128 KB |
30.txt | AC | 0 ms | 128 KB |
31.txt | AC | 0 ms | 128 KB |
32.txt | AC | 0 ms | 128 KB |
33.txt | AC | 1 ms | 128 KB |
34.txt | AC | 1 ms | 128 KB |
35.txt | AC | 1 ms | 128 KB |
36.txt | AC | 1 ms | 128 KB |
37.txt | AC | 1 ms | 128 KB |
38.txt | AC | 1 ms | 128 KB |
39.txt | AC | 1 ms | 128 KB |
40.txt | AC | 1 ms | 128 KB |
41.txt | AC | 1 ms | 128 KB |
42.txt | AC | 1 ms | 128 KB |
43.txt | AC | 0 ms | 128 KB |
44.txt | AC | 1 ms | 128 KB |
45.txt | AC | 0 ms | 128 KB |
46.txt | AC | 1 ms | 128 KB |
47.txt | AC | 0 ms | 128 KB |
48.txt | AC | 0 ms | 128 KB |
49.txt | AC | 0 ms | 128 KB |
50.txt | AC | 0 ms | 128 KB |
51.txt | AC | 0 ms | 128 KB |
52.txt | AC | 0 ms | 128 KB |
53.txt | AC | 0 ms | 128 KB |
54.txt | AC | 1 ms | 128 KB |
55.txt | AC | 0 ms | 128 KB |
56.txt | AC | 0 ms | 128 KB |
s1.txt | AC | 0 ms | 128 KB |
s2.txt | AC | 0 ms | 128 KB |
s3.txt | AC | 0 ms | 128 KB |