oj.uz

Submission #860057

# Submission time Handle Problem Language Result Execution time Memory
860057 2023-10-11T13:27:27 Z QuackPhuc Bank (IZhO14_bank) C++14
0 / 100
 0 ms 348 KB 
#include<iostream>
using namespace std;

string solved()
{
    int N; int M; cin>>N>>M;
    int array_N[N];
    int array_M[M];
    for(int i = 0; i < N; i++)
        cin>>array_N[i];
    for(int i = 0; i < M; i++)
        cin>>array_M[i];
    for(int i = 0; i < M ; i++)
    {
        for(int j = 0; j < M; j++)
        {
            if(array_M[j] == array_N[0] - array_M[i]) return "YES";
        }
    }
    return "NO";
}

int main()
{
  cout<<solved();
  return 0;
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -