oj.uz

Submission #1014398

# Submission time Handle Problem Language Result Execution time Memory
1014398 2024-07-04T20:19:19 Z amine_aroua Sličnost (COI23_slicnost) C++17
0 / 100
 83 ms 3932 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
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]];
        }
        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());
        }
    }
    cout<<ans<<'\n';
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 3932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 3932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 3932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 3932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 3932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 83 ms 3932 KB Output isn't correct
2 Halted 0 ms 0 KB -