제출 #1050137

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050137		anton	Lottery (CEOI18_lot)	C++17	45 / 100	219 ms	65536 KiB

lot

#include<bits/stdc++.h>

using namespace std;
int N, L, Q;


int dist(vector<int>& a, vector<int>& b){
    int d= 0;
    for(int i = 0; i<L; i++){
        if(a[i]!=b[i]){
            d++;
        }
    }
    return d;
}
signed main(){
    cin>>N>>L;

    vector<int> a(N);

    for(int i = 0; i<N; i++){
        cin>>a[i];
    }

    vector<vector<int>> inters;

    vector<vector<int>> adj(N-L+1);


    for(int i = 0; i<N-L+1; i++){
        vector<int> inter;
        for(int j = i; j<i+L; j++){
            inter.push_back(a[j]);
        }
        inters.push_back(inter);
    }

    for(int cur = 0; cur<N-L+1; cur++){
        for(int other= cur+1; other<N-L+1; other++){
            int d = dist(inters[cur], inters[other]);
            adj[cur].push_back(d);
            adj[other].push_back(d);
        }
    }

    cin>>Q;

    for(int i = 0; i<Q; i++){
        int k;
        cin>>k;
        for(int inter_id=  0; inter_id <N-L+1; inter_id++){
            int r =0;
            for(auto e: adj[inter_id]){
                if(e<=k){
                    r++;
                }
            }
            cout<<r<<" ";
        }
        cout<<endl;
    }
}

• Subtask 1: 25 / 25
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20