Submission #1014402

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014402		amine_aroua	Sličnost (COI23_slicnost)	C++17	0 / 100	44 ms	3928 KiB

Main

#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
#define intt long long
int main() {
    int n , k , Q;
    cin>>n>>k>>Q;
    vector<vector<int>> a(2 , vector<int>(n));
    for(int i = 0 ; i < 2 ; i++)
    {
        for(int j = 0 ; j < n ; j++)
        {
            cin>>a[i][j];
            a[i][j]--;
        }
    }
    vector<vector<bitset<N>>> bs(2 , vector<bitset<N>>(n));
    for(int i = 0 ; i < 2 ; i++)
    {
        for(int j = 0 ; j < k ; j++)
        {
            bs[i][0][a[i][j]] = 1;
        }
        for(int j = 1 ; j + k - 1 < n ; j++)
        {
            bs[i][j] = bs[i][j - 1];
            bs[i][j][a[i][j - 1]] = 0;
            bs[i][j][a[i][j + k - 1]] = 1;
        }
    }
    int ans = 0;
    for(int i = 0 ; i + k - 1 < n ; i++)
    {
        for(int j = 0 ; j + k - 1 < n ; j++)
        {
            ans = max(ans , (int)(bs[0][i] & bs[1][j]).count());
        }
    }
    intt nb = 0;
    for(int i = 0 ; i + k - 1 < n ; i++)
    {
        for(int j = 0 ; j + k - 1 < n ; j++)
        {
            if(ans == (int)(bs[0][i] & bs[1][j]).count())
            {
                nb++;
            }
        }
    }
    cout<<ans<<'\n';
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 10
• Subtask 3: 0 / 33
• Subtask 4: 0 / 7
• Subtask 5: 0 / 10
• Subtask 6: 0 / 33