oj.uz

Submission #1073969

# Submission time Handle Problem Language Result Execution time Memory
1073969 2024-08-25T05:40:30 Z lftroq Lottery (CEOI18_lot) C++14
0 / 100
 268 ms 4700 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define sqrt sqrtl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,pii> piiii;

const int N=1e4+5;
const int Q=105;

int a[N],qu[Q],dp[N][Q],rev[N];

void solve()
{
    int n,l,q;
    cin >> n >> l;
    for(int i=1;i<=n;i++) cin >> a[i];
    cin >> q;
    vector<int> v;
    for(int i=1;i<=q;i++)
    {
        cin >> qu[i];
        v.push_back(qu[i]);
    }
    v.push_back(0);
    sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());
    for(int i=0;i<(int)v.size();i++) rev[v[i]]=i;
    for(int len=1;len<=n-l;len++)
    {
        int x=1,y=len+1,d=0,p=0;
        for(int i=1;i<=l;i++)
        {
            d+=(a[x+i-1]!=a[y+i-1]);
            if(v[p]<d) p++;
        }
//        cout << len << ' ' << d << ":" << endl;
        for(;y+l-1<=n;x++,y++)
        {
            dp[x][p]++;dp[y][p]++;
//            cout << x << ' ' << y << ' ' << d << "   " << p << endl;
            d-=(a[x]!=a[y]);
            if(v[p]>d) p--;
            d+=(a[x+l]!=a[y+l]);
            if(v[p]<d) p++;
        }
//        cout << "=============" << endl;
    }
    for(int j=1;j<=n;j++) for(int i=1;i<(int)v.size();i++) dp[j][i]+=dp[j][i-1];
    for(int i=1;i<=q;i++)
    {
        for(int j=1;j<=n-l+1;j++) cout << dp[j][rev[qu[i]]] << ' ';
        cout << endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen("hanhhhh.inp","r",stdin);
    //freopen("hanhhhh.out","w",stdout);
    int t=1;
    //cin >> t;
    while(t--) solve();
    return 0;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -