Submission #1267851

#TimeUsernameProblemLanguageResultExecution timeMemory
1267851michael12은행 (IZhO14_bank)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;

int main(){
  int n,m;
  cin >> n >> m;
  vector<int> a(n), r(m);
  for(int i = 0; i < n; i++){
    cin >> a[i];
  }
  for(int j = 0; j < m; j++){
    cin >> r[j];
  }
  map<long long, int> fr;
  fr[0] = 1;

  int s = 0;
  int ans = 0;
  for(int j = 0; j < m; j++){
    s += r[j];
    ans += fr[s - a[0]];
    fr[s]++;
  }
  if(ans > 0){
    cout << "YES";
  }
  else{
    cout << "NO"; 
  }


}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...