Submission #1267853

#TimeUsernameProblemLanguageResultExecution timeMemory
1267853michael12Bank (IZhO14_bank)C++20
0 / 100
1 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; bool is = false; int s = 0; int ans = 0; int o = 0; for(int j = 0; j < m; j++){ s += r[j]; if(s > a[0]){ s -= r[o++]; } else if(s == a[0]){ is = 1; } } if(is){ 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...