제출 #1183166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1183166		aminjon__	Matching (CEOI11_mat)	C++20	36 / 100	2096 ms	20036 KiB

mat

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define endl '\n'


#pragma GCC optimize("O3")

typedef unsigned int uint;
typedef int ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
void solve() {
    ll n  , m;
    cin >> n  >>  m;
    vector<ll>a(n+1) , b(m+1);
    for(int i = 1;i <= n;i++){
        cin >> a[i];
    }   
    
    set<pair<ll,ll>> s;
    
    
    for(int i = 1;i <= m;i++){
        cin >> b[i];
        if(i < n)s.insert({b[i] , i});
    }
    vector<ll>ans;
    
    
    
    for(int i = n;i <= m;i++){
        s.insert({b[i] , i});
        if(i > n){
            s.erase({b[i-n] , i-n});
        }
        bool ok = 1;
        ll cur = 0;
        for(auto g: s){
            cur++;
            if(g.second != a[cur] + (i-n)){
                ok=0;
                break;
            }
        }
        if(ok){
            ans.push_back(i - n +1);
        }
    }cout<<ans.size()<<endl;
    for(auto g: ans){
        cout<<g<<' ';
    }
}
signed main() {
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
  ll t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 8
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10