This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define nn "\n"
#define ex exit(0);
#define sz(s) (int)(s).size()
const int N = 2e5+5;
int cnt , ans , bit , n , t , k ,x , a , b , res , p,sum , r , l ;
char h;
vector<int> v;
int main(){
ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
cin>> n >> t ;
int m[n];
map<int , int >mp;
for(int i =0 ;i < n ; i++){
cin>> m[i];
}
for(int j =0 ; j < t ; j++){
cin>> x ;
mp[x]++;
v.pb(x);
}
sort(all(v));
for(int i=0;i < n ; i++){
if(mp[m[i]]>0){
cout<<"YES";
ex;
}
else {
l = 0, r = t - 1;
while (l < r) {
if (v[l] + v[r] == m[i]) {
cout<<"YES";
ex;
}
if (v[l] + v[r] < m[i]) {
l++;
}
if (v[l] + v[r] > m[i]) {
r--;
}
}
break;
}
}
cout<<"NO";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |