提出 #57270576

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

const int N=3e5+10;
int n, k, a[N], b[N];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   int tc; cin >> tc;
   while (tc--){
      cin >> n >> k;
      for (int i=1; i<=n; ++i) cin >> a[i];
      for (int i=1; i<=n; ++i) cin >> b[i];
      bool check=1;
      for (int i=1; i<=n; ++i) check&=a[i]==b[i];
      if (check){
         cout << "Yes\n";
         continue;
      }
      if (k==1){
         vector<int> va, vb;
         for (int i=1; i<=n; ++i) if (va.empty() || va.back()!=a[i]) va.push_back(a[i]);
         for (int i=1; i<=n; ++i) if (vb.empty() || vb.back()!=b[i]) vb.push_back(b[i]);
         int j=0;
         for (int i:va) if (j<(int)vb.size() && vb[j]==i) ++j;
         if (j==(int)vb.size()) cout << "Yes\n";
         else cout << "No\n";
      }else{
         vector<vector<int>> pos(n+1);
         for (int i=1; i<=n; ++i) pos[b[i]].push_back(i);
         vector<int> cnt(n+1);
         for (int i=1; i<=n; ++i) ++cnt[a[i]];
         bool ans=0;
         for (int i=1; i<=n; ++i){
            for (int j=1; j<(int)pos[i].size(); ++j) ans|=pos[i][j]-pos[i][j-1]<=k;
         }
         for (int i=1; i<=n; ++i) ans&=!!cnt[b[i]];
         cout << (ans?"Yes\n":"No\n");
      }
   }
   return 0;
}

提出情報

提出日時
問題 B - Near Assignment
ユーザ huutuan
言語 C++ 20 (gcc 12.2)
得点 600
コード長 1340 Byte
結果 AC
実行時間 48 ms
メモリ 16772 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 600 / 600
結果
AC × 1
AC × 56
セット名 テストケース
Sample 00-sample-001.txt
All 00-sample-001.txt, 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt, 01-026.txt, 01-027.txt, 01-028.txt, 01-029.txt, 01-030.txt, 01-031.txt, 01-032.txt, 01-033.txt, 01-034.txt, 01-035.txt, 01-036.txt, 01-037.txt, 01-038.txt, 01-039.txt, 01-040.txt, 01-041.txt, 01-042.txt, 01-043.txt, 01-044.txt, 01-045.txt, 01-046.txt, 01-047.txt, 01-048.txt, 01-049.txt, 01-050.txt, 01-051.txt, 01-052.txt, 01-053.txt, 01-054.txt, 01-055.txt
ケース名 結果 実行時間 メモリ
00-sample-001.txt AC 1 ms 3496 KiB
01-001.txt AC 30 ms 3516 KiB
01-002.txt AC 30 ms 3480 KiB
01-003.txt AC 28 ms 3552 KiB
01-004.txt AC 27 ms 3504 KiB
01-005.txt AC 28 ms 3600 KiB
01-006.txt AC 26 ms 3592 KiB
01-007.txt AC 25 ms 3384 KiB
01-008.txt AC 26 ms 3500 KiB
01-009.txt AC 27 ms 3648 KiB
01-010.txt AC 28 ms 3600 KiB
01-011.txt AC 29 ms 3572 KiB
01-012.txt AC 31 ms 4188 KiB
01-013.txt AC 48 ms 16772 KiB
01-014.txt AC 25 ms 5504 KiB
01-015.txt AC 25 ms 5320 KiB
01-016.txt AC 25 ms 5356 KiB
01-017.txt AC 20 ms 7616 KiB
01-018.txt AC 20 ms 7016 KiB
01-019.txt AC 20 ms 6136 KiB
01-020.txt AC 21 ms 6904 KiB
01-021.txt AC 23 ms 7644 KiB
01-022.txt AC 23 ms 6792 KiB
01-023.txt AC 25 ms 7692 KiB
01-024.txt AC 26 ms 7708 KiB
01-025.txt AC 28 ms 7644 KiB
01-026.txt AC 28 ms 7708 KiB
01-027.txt AC 16 ms 5452 KiB
01-028.txt AC 15 ms 5544 KiB
01-029.txt AC 18 ms 6528 KiB
01-030.txt AC 20 ms 13136 KiB
01-031.txt AC 21 ms 13336 KiB
01-032.txt AC 21 ms 13308 KiB
01-033.txt AC 23 ms 13400 KiB
01-034.txt AC 24 ms 13140 KiB
01-035.txt AC 22 ms 13348 KiB
01-036.txt AC 24 ms 13572 KiB
01-037.txt AC 24 ms 13940 KiB
01-038.txt AC 24 ms 13572 KiB
01-039.txt AC 24 ms 13076 KiB
01-040.txt AC 24 ms 13036 KiB
01-041.txt AC 26 ms 13064 KiB
01-042.txt AC 27 ms 13120 KiB
01-043.txt AC 28 ms 13572 KiB
01-044.txt AC 28 ms 13584 KiB
01-045.txt AC 32 ms 13608 KiB
01-046.txt AC 32 ms 13580 KiB
01-047.txt AC 37 ms 14672 KiB
01-048.txt AC 35 ms 14660 KiB
01-049.txt AC 47 ms 16768 KiB
01-050.txt AC 44 ms 16704 KiB
01-051.txt AC 19 ms 5396 KiB
01-052.txt AC 27 ms 13508 KiB
01-053.txt AC 29 ms 13584 KiB
01-054.txt AC 36 ms 14708 KiB
01-055.txt AC 41 ms 15696 KiB