제출 #580334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
580334		talant117408	Lottery (CEOI18_lot)	C++17	45 / 100	268 ms	1592 KiB

lot

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

#define long                unsigned long 
#define pb                  push_back
#define mp                  make_pair
#define all(v)              (v).begin(),(v).end()
#define rall(v)             (v).rbegin(),(v).rend()
#define lb                  lower_bound
#define ub                  upper_bound
#define sz(v)               int((v).size())
#define do_not_disturb      ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl                '\n'

void solve() {
    int n, l;
    cin >> n >> l;
    vector <int> v(n);
    for (auto &to : v) cin >> to;
    int q;
    cin >> q;
    vector <int> queries(q);
    for (auto &to : queries) cin >> to;
    if (n <= 300) {
        vector <vector <int>> dp(n-l+1, vector <int> (l+1)), intervals(n-l+1);
        for (int i = 0; i < n-l+1; i++) {
            for (int j = 0; j < l; j++) {
                intervals[i].pb(v[i+j]);
            }
        }
        for (int i = 0; i < n-l+1; i++) {
            for (int j = i+1; j < n-l+1; j++) {
                int cnt = 0;
                for (int k = 0; k < l; k++) {
                    cnt += (intervals[i][k] != intervals[j][k]);
                }
                dp[i][cnt]++;
                dp[j][cnt]++;
            }
        }
        for (int i = 0; i < n-l+1; i++) {
            for (int j = 1; j <= l; j++) dp[i][j] += dp[i][j-1];
        }
        for (auto to : queries) {
            for (int i = 0; i < n-l+1; i++) cout << dp[i][to] << ' ';
            cout << endl;
        }
        return;
    }
    
    if (q > 1 || queries[0] != 0) return;
    
    const ll P = 541541415;
    const ll mod = 1e18+1337;
    
    set <ll> st;
    map <ll, vector <int>> pos;
    for (int i = 0; i < n-l+1; i++) {
        ll h = 0;
        ll res = 1;
        for (int j = 0; j < l; j++) {
            ll f = ((res * v[i+j]) % mod + mod) % mod;
            h = ((h + f) % mod + mod) % mod;
            res = ((res * P) % mod + mod) % mod;
        }
        pos[h].pb(i);
        st.insert(h);
    }
    
    vector <int> ans(n-l+1);
    for (auto to : st) {
        for (auto x : pos[to]) ans[x] = sz(pos[to])-1;
    }
    for (auto to : ans) cout << to << ' ';
}

int main() {
    //~ freopen("in.txt", "r", stdin);
    do_not_disturb
    
    int t = 1;
    //~ cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 0 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20