oj.uz

Submission #254388

# Submission time Handle Problem Language Result Execution time Memory
254388 2020-07-29T23:27:55 Z MarcoMeijer Lottery (CEOI18_lot) C++14
35 / 100
 854 ms 1144 KB 
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi," ",x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }

//===================//
//  Added libraries  //
//===================//

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 10002;
int n, m, l, q;
int a[MX], b[MX], k[MX];
int SK[MX], K[MX], RSK[MX];
vi f[MX];
int dist[MX], sdist[MX];
int ans[100][MX];

int getDif(int x, int y) {
    int ans=0;
    RE(i,l) if(a[x+i] != a[y+i]) ans++;
    return ans;
}
void addDist(int v, int i, int del) {
    FOR(u,f[v]) {
        int v=u-i;
        if(v<0) continue;
        if(v>n-l+1) break;
        dist[v] += del;
    }
}
void getDif(int x) {
    // fill dist table
    if(x == 0) {
        RE(i,n) dist[i] = l;
        RE(i,l) {
            addDist(a[x+i],i,-1);
        }
    } else {
        addDist(a[x-1],0,1);
        REV(i,0,n-l+1) dist[i+1] = dist[i];
        addDist(a[x+l-1],l-1,-1);
        dist[0] = getDif(0,x);
    }

    // answer queries
    RE(i,q) ans[i][x] = 0;
    ans[0][x] = -1;
    RE(j,n-l+1) {
        ans[lower_bound(K,K+q,dist[j])-K][x]++;
    }
    REP(i,1,q) ans[i][x] += ans[i-1][x];
}

void program() {
    IN(n, l);
    RE(i,n) IN(a[i]);
    IN(q);
    RE(i,q) IN(k[i]);
    RE(i,q) SK[i]=i;
    sort(SK,SK+q,[](int i, int j) {
        return k[i]<k[j];
    });
    RE(i,q) K[SK[i]] = k[i];
    RE(i,q) RSK[i] = SK[i];

    RE(i,n) b[i]=a[i];
    sort(b,b+n);
    m = unique(b,b+n)-b;
    RE(i,n) a[i] = lower_bound(b,b+m,a[i])-b;
    RE(i,n) f[a[i]].pb(i);

    RE(i,n-l+1) getDif(i);
    OUTL();

    RE(i,q) {
        RE(j,n-l+1) OUT(j==0?"":" ",ans[RSK[i]][j]);
        OUTL();
    }
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 640 KB Output is correct
2 Incorrect 1 ms 640 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 640 KB Output is correct
2 Incorrect 1 ms 640 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 822 ms 888 KB Output is correct
2 Correct 693 ms 1144 KB Output is correct
3 Correct 425 ms 888 KB Output is correct
4 Correct 353 ms 1016 KB Output is correct
5 Correct 252 ms 888 KB Output is correct
6 Correct 318 ms 1016 KB Output is correct
7 Correct 386 ms 888 KB Output is correct
8 Correct 600 ms 1144 KB Output is correct
9 Correct 388 ms 888 KB Output is correct
10 Correct 397 ms 888 KB Output is correct
11 Correct 33 ms 640 KB Output is correct
12 Correct 253 ms 896 KB Output is correct
13 Correct 204 ms 888 KB Output is correct
14 Correct 250 ms 1016 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 822 ms 888 KB Output is correct
2 Correct 693 ms 1144 KB Output is correct
3 Correct 425 ms 888 KB Output is correct
4 Correct 353 ms 1016 KB Output is correct
5 Correct 252 ms 888 KB Output is correct
6 Correct 318 ms 1016 KB Output is correct
7 Correct 386 ms 888 KB Output is correct
8 Correct 600 ms 1144 KB Output is correct
9 Correct 388 ms 888 KB Output is correct
10 Correct 397 ms 888 KB Output is correct
11 Correct 33 ms 640 KB Output is correct
12 Correct 253 ms 896 KB Output is correct
13 Correct 204 ms 888 KB Output is correct
14 Correct 250 ms 1016 KB Output is correct
15 Correct 854 ms 888 KB Output is correct
16 Correct 300 ms 888 KB Output is correct
17 Correct 418 ms 1016 KB Output is correct
18 Correct 359 ms 1016 KB Output is correct
19 Correct 353 ms 1016 KB Output is correct
20 Correct 367 ms 884 KB Output is correct
21 Correct 357 ms 888 KB Output is correct

Subtask #5
0 / 20.0

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