제출 #1183213

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1183213		mmusom	Matching (CEOI11_mat)	C++20	18 / 100	2095 ms	18604 KiB

mat

#include<bits/stdc++.h>

#define int long long

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;

//#define ordered_multiset tree<long long, null_type,less_equal<long long>, rb_tree_tag,tree_order_statistics_node_update>
//#define ordered_set tree<long long, null_type,less<long long>, rb_tree_tag,tree_order_statistics_node_update>

//st.order_of_key
//st.find_by_order

main(){
    #ifndef ONLINE_JUDGE
//        freopen("input.txt", "r", stdin);
//        freopen("output.txt", "w", stdout);
//        freopen("deleg.in", "r", stdin);
//        freopen("deleg.out", "w", stdout);
    #endif
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m;
    cin>>n>>m;
    vector<int> a(n+1);
    for(int i=1;i<=n;++i){
        cin>>a[i];
    }
    vector<int> b(m+1),ans;
    vector<pair<int,int>> v;
    for(int i=1;i<=m;++i){
        cin>>b[i];
        if(i<n){
            continue;
        }
        for(int j=i;j>i-n;--j){
            v.push_back({b[j],n-i+j});
        }
        sort(v.begin(),v.end());
        ans.push_back(i-n+1);
        for(int j=0;j<n;++j){
            if(v[j].second!=a[j+1]){
                ans.pop_back();
                break;
            }
        }
        v.clear();
    }
    cout<<ans.size()<<"\n";
    for(int to:ans){
        cout<<to<<" ";
    }
}

컴파일 시 표준 에러 (stderr) 메시지

mat.cpp:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 | main(){
      | ^~~~

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 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