Submission #33953558

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,a,n) for (ll i=a;i<(ll)n;i++)
#define per(i,a,n) for (ll i=n;i-->(ll)a;)

ll read(){ll r;scanf("%lld",&r);return r;} // read

int n;

ll a[10];
ll b[10];

void pack(ll x, ll y) {
  ll c = min(a[x], b[y]);
  a[x] -= c;
  b[y] -= c;
  if(y-x) b[y - x] += c; // c个工人的负重还剩下y-x
  return;
}

void w(){
  rep(i,1,5+1) a[i] = read();
  rep(i,1,5+1) b[i] = read();

  per(i,1,5+1){
    pack(i,i);
    per(j,i+1,5+1) pack(i,j);
    pack(i,i);
  }

  bool ans = true;
  rep(i,1,5+1)if (a[i] > 0)ans = false;
  printf("%s\n", ans? "Yes": "No");
}

int main(){
  int t = read();
  while(t--) w();
  return 0;
}

Submission Info

Submission Time
Task G - The baggage
User cromarmot
Language C++ (GCC 9.2.1)
Score 600
Code Size 699 Byte
Status AC
Exec Time 81 ms
Memory 3764 KiB

Compile Error

./Main.cpp: In function ‘ll read()’:
./Main.cpp:8:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    8 | ll read(){ll r;scanf("%lld",&r);return r;} // read
      |                ~~~~~^~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 1
AC × 48
Set Name Test Cases
Sample example_00.txt
All example_00.txt, hand_00.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, shuffle_00.txt, shuffle_01.txt, shuffle_02.txt, shuffle_03.txt, shuffle_04.txt, shuffle_05.txt, shuffle_06.txt, shuffle_07.txt, shuffle_08.txt, shuffle_09.txt, shuffle_10.txt, shuffle_11.txt, shuffle_12.txt, shuffle_13.txt, shuffle_14.txt, shuffle_15.txt, shuffle_16.txt, shuffle_17.txt, shuffle_18.txt, shuffle_19.txt, shuffle_20.txt, shuffle_21.txt, shuffle_22.txt, shuffle_23.txt, shuffle_24.txt, shuffle_25.txt, shuffle_26.txt, shuffle_27.txt, shuffle_28.txt, shuffle_29.txt, shuffle_30.txt, shuffle_31.txt, shuffle_32.txt, shuffle_33.txt, shuffle_34.txt, shuffle_35.txt
Case Name Status Exec Time Memory
example_00.txt AC 8 ms 3500 KiB
hand_00.txt AC 81 ms 3624 KiB
random_00.txt AC 77 ms 3480 KiB
random_01.txt AC 77 ms 3628 KiB
random_02.txt AC 77 ms 3576 KiB
random_03.txt AC 72 ms 3604 KiB
random_04.txt AC 73 ms 3600 KiB
random_05.txt AC 78 ms 3468 KiB
random_06.txt AC 73 ms 3640 KiB
random_07.txt AC 73 ms 3492 KiB
random_08.txt AC 74 ms 3640 KiB
random_09.txt AC 79 ms 3628 KiB
shuffle_00.txt AC 71 ms 3728 KiB
shuffle_01.txt AC 72 ms 3724 KiB
shuffle_02.txt AC 71 ms 3632 KiB
shuffle_03.txt AC 67 ms 3600 KiB
shuffle_04.txt AC 71 ms 3596 KiB
shuffle_05.txt AC 70 ms 3484 KiB
shuffle_06.txt AC 70 ms 3764 KiB
shuffle_07.txt AC 74 ms 3628 KiB
shuffle_08.txt AC 68 ms 3596 KiB
shuffle_09.txt AC 71 ms 3604 KiB
shuffle_10.txt AC 72 ms 3476 KiB
shuffle_11.txt AC 71 ms 3492 KiB
shuffle_12.txt AC 72 ms 3488 KiB
shuffle_13.txt AC 74 ms 3600 KiB
shuffle_14.txt AC 69 ms 3668 KiB
shuffle_15.txt AC 72 ms 3596 KiB
shuffle_16.txt AC 71 ms 3492 KiB
shuffle_17.txt AC 72 ms 3496 KiB
shuffle_18.txt AC 74 ms 3488 KiB
shuffle_19.txt AC 68 ms 3476 KiB
shuffle_20.txt AC 69 ms 3500 KiB
shuffle_21.txt AC 72 ms 3668 KiB
shuffle_22.txt AC 74 ms 3480 KiB
shuffle_23.txt AC 74 ms 3640 KiB
shuffle_24.txt AC 73 ms 3484 KiB
shuffle_25.txt AC 74 ms 3600 KiB
shuffle_26.txt AC 78 ms 3480 KiB
shuffle_27.txt AC 67 ms 3492 KiB
shuffle_28.txt AC 68 ms 3628 KiB
shuffle_29.txt AC 79 ms 3488 KiB
shuffle_30.txt AC 70 ms 3636 KiB
shuffle_31.txt AC 69 ms 3492 KiB
shuffle_32.txt AC 72 ms 3496 KiB
shuffle_33.txt AC 73 ms 3612 KiB
shuffle_34.txt AC 75 ms 3448 KiB
shuffle_35.txt AC 75 ms 3632 KiB