oj.uz

Submission #666380

# Submission time Handle Problem Language Result Execution time Memory
666380 2022-11-28T11:02:14 Z ktkerem Lottery (CEOI18_lot) C++17
0 / 100
 2 ms 852 KB 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
/**/
typedef int ll;
//typedef long long ll;
typedef unsigned long long ull;
typedef std::string str;
/*typedef __int128 vll;
typedef unsigned __int128 uvll;*/
#define llll std::pair<ll , ll>
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e9+7; 
const ll ous = 1e5 + 7;
const ll dx[4] = {-1 , 0 , 1 , 0} , dy[4] = {0,1,0,-1};
ll n , m;std::vector<ll> ar;
void solve(){
    std::cin >> n >> m;
    ar.resize(n);
    for(ll i = 0;n>i;i++){
        std::cin >> ar[i];    
    }
    ll q;std::cin >> q;
    ll ans[q+5][n - m + 10];
    memset(ans , 0 , sizeof(ans));
    std::vector<llll> que;
    que.pb({limit , limit});
    for(ll i = 0;q>i;i++){
        ll x;std::cin >> x;
        que.pb({x , i});
    }
    std::sort(all(que));
    for(ll i = 1;n - m>=i;i++){
        ll cst = 0;
        for(ll j = 0;m>j;j++){
            cst += (ar[j] != ar[i + j]);
        }
        llll y = {cst , -limit};
        ll o = std::lower_bound(all(que) , y) - que.begin();
        if(o != limit){
            ans[que[o].sec][0]++;
            ans[que[o].sec][i]++;
        }
        for(ll j = m;n>j+i;j++){
            cst -= (ar[j - m] != ar[j-m+i]);
            cst += (ar[j] != ar[j + i]);
            y = {cst , -limit};
            o = std::lower_bound(all(que) , y) - que.begin();
            if(o != limit){
                ans[que[o].sec][j - m + 1]++;
                ans[que[o].sec][i + j - m + 1]++;
            }
        }
    }
    for(ll i =1;q>i;i++){
        for(ll j =0;n-m+1>j;j++){
            ans[que[i].sec][j] += ans[que[i-1].sec][j]; 
        }
    }
    for(ll i =0;q>i;i++){
        for(ll j =0;n-m+1>j;j++){
            std::cout << ans[i][j] << " ";
        }
        std::cout << "\n";
    }
    return;/**/
}
signed main(){
    ll t=1;
    //std::cin >> t;
    ll o = 1;
    while(t--){ 
        //cout << "Case " << o++ << ":\n";
        solve();
    }
    return 0;
}/**/

Compilation message

lot.cpp:5:78: warning: "/*" within comment [-Wcomment]
    5 | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
      |                                                                               
lot.cpp: In function 'int main()':
lot.cpp:79:8: warning: unused variable 'o' [-Wunused-variable]
   79 |     ll o = 1;
      |        ^

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 340 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 340 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 852 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 852 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 340 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -