Submission #31846361

Source Code Expand

#include <bits/stdc++.h>
#define sz(c) int(c.size())
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
using namespace std;
using ll = long long;

#ifdef LOCAL
#include <local/debug.h>
#else
#define debug(...) (void)0
#endif

int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);

  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i, 0, n) cin >> a[i];
  int max = *max_element(a.begin(), a.end());
  rep(i, 0, k) {
    int x;
    cin >> x;
    if (a[x - 1] == max) {
      cout << "Yes\n";
      return 0;
    }
  }
  cout << "No\n";
}

Submission Info

Submission Time
Task B - Takahashi's Failure
User ami
Language C++ (GCC 9.2.1)
Score 200
Code Size 646 Byte
Status AC
Exec Time 7 ms
Memory 3592 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 20
Set Name Test Cases
Sample example_00.txt, example_01.txt, example_02.txt
All example_00.txt, example_01.txt, example_02.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, hand_07.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt
Case Name Status Exec Time Memory
example_00.txt AC 7 ms 3440 KiB
example_01.txt AC 2 ms 3584 KiB
example_02.txt AC 2 ms 3572 KiB
hand_00.txt AC 2 ms 3540 KiB
hand_01.txt AC 2 ms 3456 KiB
hand_02.txt AC 2 ms 3588 KiB
hand_03.txt AC 2 ms 3512 KiB
hand_04.txt AC 2 ms 3404 KiB
hand_05.txt AC 2 ms 3448 KiB
hand_06.txt AC 1 ms 3544 KiB
hand_07.txt AC 2 ms 3580 KiB
random_00.txt AC 2 ms 3536 KiB
random_01.txt AC 1 ms 3488 KiB
random_02.txt AC 2 ms 3444 KiB
random_03.txt AC 2 ms 3544 KiB
random_04.txt AC 2 ms 3592 KiB
random_05.txt AC 2 ms 3588 KiB
random_06.txt AC 2 ms 3448 KiB
random_07.txt AC 4 ms 3580 KiB
random_08.txt AC 2 ms 3540 KiB