提出 #34171396

ソースコード 拡げる

#include<bits/stdc++.h>
#define int long long
using namespace std;int n,m,k,a[200010],ans,res;void Solve_Test(){scanf("%lld%lld%lld",&n,&m,&k);for(int i=1;i<=n;++i)scanf("%lld",&a[i]);for(int i=32,j=1ll<<31ll;i--;j>>=1ll){sort(a+1,a+n+1),reverse(a+1,a+n+1),res=0;for(int l=1;l<=k;++l)if(!(a[l]&j))res+=j-a[l];if(res<=m){m-=res,ans|=j;if(res){for(int l=1;l<=n;++l)if(!(a[l]&j)||l>k)a[l]=0;}else for(int l=1;l<=n;++l)if(!(a[l]&j))a[l]=0;}for(int l=1;l<=n;++l)a[l]&=~j;}printf("%lld",ans);}const bool BASE=0;int T=1;signed main(){if(BASE)cin>>T;while(T--)Solve_Test();return 0;}

提出情報

提出日時
問題 B - Plus and AND
ユーザ Treap
言語 C++ (GCC 9.2.1)
得点 500
コード長 577 Byte
結果 AC
実行時間 298 ms
メモリ 5360 KiB

コンパイルエラー

./Main.cpp: In function ‘void Solve_Test()’:
./Main.cpp:3:72: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    3 | using namespace std;int n,m,k,a[200010],ans,res;void Solve_Test(){scanf("%lld%lld%lld",&n,&m,&k);for(int i=1;i<=n;++i)scanf("%lld",&a[i]);for(int i=32,j=1ll<<31ll;i--;j>>=1ll){sort(a+1,a+n+1),reverse(a+1,a+n+1),res=0;for(int l=1;l<=k;++l)if(!(a[l]&j))res+=j-a[l];if(res<=m){m-=res,ans|=j;if(res){for(int l=1;l<=n;++l)if(!(a[l]&j)||l>k)a[l]=0;}else for(int l=1;l<=n;++l)if(!(a[l]&j))a[l]=0;}for(int l=1;l<=n;++l)a[l]&=~j;}printf("%lld",ans);}const bool BASE=0;int T=1;signed main(){if(BASE)cin>>T;while(T--)Solve_Test();return 0;}
      |                                                                   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
./Main.cpp:3:124: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    3 | using namespace std;int n,m,k,a[200010],ans,res;void Solve_Test(){scanf("%lld%lld%lld",&n,&m,&k);for(int i=1;i<=n;++i)scanf("%lld",&a[i]);for(int i=32,j=1ll<<31ll;i--;j>>=1ll){sort(a+1,a+n+1),reverse(a+1,a+n+1),res=0;for(int l=1;l<=k;++l)if(!(a[l]&j))res+=j-a[l];if(res<=m){m-=res,ans|=j;if(res){for(int l=1;l<=n;++l)if(!(a[l]&j)||l>k)a[l]=0;}else for(int l=1;l<=n;++l)if(!(a[l]&j))a[l]=0;}for(int l=1;l<=n;++l)a[l]&=~j;}printf("%lld",ans);}const bool BASE=0;int T=1;signed main(){if(BASE)cin>>T;while(T--)Solve_Test();return 0;}
      |                                                                                                                       ~~~~~^~~~~~~~~~~~~~

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 500 / 500
結果
AC × 2
AC × 58
セット名 テストケース
Sample example_00.txt, example_01.txt
All example_00.txt, example_01.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt
ケース名 結果 実行時間 メモリ
example_00.txt AC 8 ms 3580 KiB
example_01.txt AC 2 ms 3708 KiB
test_00.txt AC 201 ms 4904 KiB
test_01.txt AC 298 ms 5296 KiB
test_02.txt AC 223 ms 4924 KiB
test_03.txt AC 159 ms 4528 KiB
test_04.txt AC 37 ms 3900 KiB
test_05.txt AC 148 ms 4956 KiB
test_06.txt AC 91 ms 4240 KiB
test_07.txt AC 48 ms 4236 KiB
test_08.txt AC 65 ms 4472 KiB
test_09.txt AC 139 ms 5112 KiB
test_10.txt AC 6 ms 3724 KiB
test_11.txt AC 31 ms 3740 KiB
test_12.txt AC 49 ms 3968 KiB
test_13.txt AC 15 ms 3868 KiB
test_14.txt AC 147 ms 4568 KiB
test_15.txt AC 41 ms 4196 KiB
test_16.txt AC 23 ms 3832 KiB
test_17.txt AC 16 ms 3808 KiB
test_18.txt AC 218 ms 4852 KiB
test_19.txt AC 101 ms 4964 KiB
test_20.txt AC 280 ms 5120 KiB
test_21.txt AC 262 ms 5292 KiB
test_22.txt AC 174 ms 5172 KiB
test_23.txt AC 187 ms 5252 KiB
test_24.txt AC 159 ms 5136 KiB
test_25.txt AC 100 ms 5252 KiB
test_26.txt AC 281 ms 5168 KiB
test_27.txt AC 253 ms 5296 KiB
test_28.txt AC 112 ms 5352 KiB
test_29.txt AC 251 ms 5360 KiB
test_30.txt AC 143 ms 4920 KiB
test_31.txt AC 81 ms 4136 KiB
test_32.txt AC 153 ms 4916 KiB
test_33.txt AC 28 ms 3800 KiB
test_34.txt AC 178 ms 5160 KiB
test_35.txt AC 256 ms 5196 KiB
test_36.txt AC 68 ms 4140 KiB
test_37.txt AC 170 ms 4684 KiB
test_38.txt AC 11 ms 3720 KiB
test_39.txt AC 19 ms 3824 KiB
test_40.txt AC 227 ms 5104 KiB
test_41.txt AC 68 ms 3972 KiB
test_42.txt AC 114 ms 5072 KiB
test_43.txt AC 114 ms 4496 KiB
test_44.txt AC 31 ms 3888 KiB
test_45.txt AC 61 ms 4584 KiB
test_46.txt AC 165 ms 4676 KiB
test_47.txt AC 272 ms 5176 KiB
test_48.txt AC 31 ms 3828 KiB
test_49.txt AC 66 ms 4172 KiB
test_50.txt AC 74 ms 3988 KiB
test_51.txt AC 193 ms 4640 KiB
test_52.txt AC 10 ms 3780 KiB
test_53.txt AC 282 ms 5280 KiB
test_54.txt AC 107 ms 4308 KiB
test_55.txt AC 194 ms 4776 KiB