Submission #51385705


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
constexpr int mod=998244353;
template<int mod=::mod>ll quickpow(ll x,int k,ll ret=1){
	for(; k; k>>=1,x=x*x%mod)
		(k&1)&&(ret=ret*x%mod);
	return ret;
}
void modp(int&x){
	x>=mod&&(x-=mod);
}
void modn(int&x){
	x<0&&(x+=mod);
}
void modma(int&x,const int a,const int b){
	x=(x+ll(a)*b)%mod;
}
constexpr int max_n=1000000;
int a[max_n+1],b[6];
void test(){
	int n=5;
	for(int i=1; i<=n; ++i)
		scanf("%d",a+i);
	for(int i=1; i<=n; ++i)
		scanf("%d",b+i);
	int sum=(a[5]*2+a[4])-(a[1]*2+a[2]);
	if(sum>=0){
		puts("0");
		return;
	}
	sum=-sum;
	if(b[5]>b[4]*2)
		b[5]=b[4]*2;
	if(b[4]>b[5])
		b[4]=b[5];
	printf("%lld\n",ll(sum/2)*b[5]+sum%2*b[4]);
}
int main(){
//	test();
	int t;
	for(scanf("%d",&t); t; test(),--t);
	return 0;
}

Submission Info

Submission Time
Task B - Bought Review
User wangzhifang
Language C++ 20 (gcc 12.2)
Score 300
Code Size 869 Byte
Status AC
Exec Time 11 ms
Memory 3876 KiB

Compile Error

Main.cpp: In function ‘void test()’:
Main.cpp:25:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   25 |                 scanf("%d",a+i);
      |                 ~~~~~^~~~~~~~~~
Main.cpp:27:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   27 |                 scanf("%d",b+i);
      |                 ~~~~~^~~~~~~~~~
Main.cpp: In function ‘int main()’:
Main.cpp:43:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   43 |         for(scanf("%d",&t); t; test(),--t);
      |             ~~~~~^~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 1
AC × 40
Set Name Test Cases
Sample sample_01.txt
All sample_01.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
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3876 KiB
test_01.txt AC 1 ms 3620 KiB
test_02.txt AC 1 ms 3756 KiB
test_03.txt AC 6 ms 3688 KiB
test_04.txt AC 6 ms 3748 KiB
test_05.txt AC 6 ms 3868 KiB
test_06.txt AC 6 ms 3648 KiB
test_07.txt AC 6 ms 3684 KiB
test_08.txt AC 5 ms 3572 KiB
test_09.txt AC 7 ms 3644 KiB
test_10.txt AC 7 ms 3620 KiB
test_11.txt AC 7 ms 3808 KiB
test_12.txt AC 7 ms 3652 KiB
test_13.txt AC 7 ms 3652 KiB
test_14.txt AC 7 ms 3676 KiB
test_15.txt AC 7 ms 3680 KiB
test_16.txt AC 7 ms 3744 KiB
test_17.txt AC 7 ms 3576 KiB
test_18.txt AC 7 ms 3876 KiB
test_19.txt AC 11 ms 3808 KiB
test_20.txt AC 11 ms 3584 KiB
test_21.txt AC 11 ms 3756 KiB
test_22.txt AC 11 ms 3804 KiB
test_23.txt AC 11 ms 3620 KiB
test_24.txt AC 11 ms 3760 KiB
test_25.txt AC 11 ms 3744 KiB
test_26.txt AC 11 ms 3624 KiB
test_27.txt AC 11 ms 3624 KiB
test_28.txt AC 11 ms 3580 KiB
test_29.txt AC 10 ms 3680 KiB
test_30.txt AC 10 ms 3608 KiB
test_31.txt AC 10 ms 3580 KiB
test_32.txt AC 11 ms 3672 KiB
test_33.txt AC 11 ms 3620 KiB
test_34.txt AC 11 ms 3572 KiB
test_35.txt AC 10 ms 3740 KiB
test_36.txt AC 10 ms 3572 KiB
test_37.txt AC 10 ms 3680 KiB
test_38.txt AC 11 ms 3744 KiB
test_39.txt AC 2 ms 3808 KiB