fork download
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4. #include <map>
  5. #include <deque>
  6. #include <cmath>
  7. #include <set>
  8. #include <unordered_map>
  9. #include <iomanip>
  10. #include <climits>
  11.  
  12. using namespace std;
  13.  
  14. #define all(v) ((v).begin()), ((v).end())
  15. #define sz(v) ((int)((v).size()))
  16. #define clr(v, d) memset(v, d, sizeof(v))
  17. #define rep(i, v) for (int i = 0; i < sz(v); ++i)
  18. #define lp(i, n) for (int i = 0; i < (int)(n); ++i)
  19. #define lpi(i, j, n) for (int i = (j); i < (int)(n); ++i)
  20. #define lpd(i, j, n) for (int i = (j); i >= (int)(n); --i)
  21. typedef long long ll;
  22.  
  23. void fast_io(){
  24. ios_base::sync_with_stdio(false);
  25. cin.tie(nullptr);
  26. cout.tie(nullptr);
  27. #ifndef ONLINE_JUDGE
  28. freopen("input.txt", "r", stdin);
  29. freopen("output.txt", "w", stdout);
  30. #endif
  31. }
  32.  
  33. int main(){
  34. fast_io();
  35. int t;
  36. cin >> t;
  37. while (t--){
  38. int n;
  39. cin >> n;
  40. ll a[n];
  41. int a_pre[n+1] = {0};
  42. ll b[n];
  43. int ability[n];
  44.  
  45. lp(i, n){
  46. cin >> a[i];
  47. a_pre[i+1] = a[i] + a_pre[i];
  48. }
  49. lp(i, n){
  50. cin >> b[i];
  51. }
  52.  
  53. lp(i, n){
  54. if (binary_search(a_pre + i, a_pre + n + 1, b[i] + a_pre[i])){
  55. ability[i] = 1;
  56. }else{
  57. ability[i] = 0;
  58. }
  59. }
  60.  
  61. lp(i, n){
  62. cout << ability[i] << " ";
  63. }
  64. }
  65. }
Success #stdin #stdout 0s 5324KB
stdin
1
5
1 2 3 4 5
6 5 6 9 3
stdout
1 1 0 1 0