QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#499679 | #6730. Coolbits | zmrzmr | WA | 490ms | 6256kb | C++17 | 886b | 2024-07-31 16:56:04 | 2024-07-31 16:56:04 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5+10;
int cnt[N];
int l[N],r[N];
void slove()
{
int ans;
int minr = 1e9+1;
int n;
cin>>n;
for(int i = 1 ; i <= n ; i++ )
cnt[i] = 0;
int flag ;
for(int i = 1; i <= n ; i++ )
{
cin>>l[i]>>r[i];
if(minr>r[i])
{
minr = r[i];
flag = i;
}
}
if(n==1)
{
cout<<r[1]<<endl;
return ;
}
for(int i = 1; i <= n ; i++ )
{
if(i==flag) continue;
while(r[i]>0)
{
cnt[i]++;
r[i]/=2;
}
}
/* for(int i = 1; i <= n ; i++ )
{
cout<<cnt[i]<<" ";
}*/
for(int i = 1 ; i <= n ; i++)
{
if(i==flag) continue;
int y = cnt[i] - 1;
int num = pow(2,y);
ans = minr & ( num - 1 );
}
cout<<ans<<endl;
}
signed main()
{
int tcase;
cin>>tcase;
while(tcase--)
{
slove();
}
}
/*
1
3
0 8
2 6
3 9
4 0 4*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3920kb
input:
2 3 0 8 2 6 3 9 1 1 100
output:
6 100
result:
ok 2 number(s): "6 100"
Test #2:
score: -100
Wrong Answer
time: 490ms
memory: 6256kb
input:
1117 74 234256176 451122435 614716780 701954053 31102604 284818525 528763990 809400397 40637446 612671528 329403504 936190213 112402633 729525189 248142852 481053286 30877745 700834811 529884578 749041634 146522084 758550567 934650972 996096650 538751855 856147351 170918541 975066425 253153230 35361...
output:
93281727 178897983 69014816 115213978 156709101 48236211 88265286 150841039 171994003 310407464 144137157 42855333 68315319 120900807 114930940 76692399 434316427 99517528 55894474 135007650 271902974 83920537 205049062 86118041 137060588 59618653 55717970 75700110 312760218 91784122 57712698 244249...
result:
wrong answer 1st numbers differ - expected: '29882460', found: '93281727'