Submission #1167231

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167231		SmuggingSpun	Lottery (CEOI18_lot)	C++20	45 / 100	18 ms	19784 KiB

lot

#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
const int lim = 1e4 + 5;
int n, len, q, a[lim];
namespace sub1{
    void solve(){
        vector<vector<int>>cnt(n - len + 2, vector<int>(len + 1, 0));
        for(int i = 1; i + len - 1 <= n; i++){
            for(int j = i + 1; j + len - 1 <= n; j++){
                int s = 0;
                for(int k = 0; k < len; k++){
                    if(a[i + k] != a[j + k]){
                        s++;
                    }
                }
                cnt[i][s]++;
                cnt[j][s]++;
            }
        }
        for(int i = 1; i + len - 1 <= n; i++){
            for(int j = 1; j <= len; j++){
                cnt[i][j] += cnt[i][j - 1];
            }
        }
        for(int _ = 0; _ < q; _++){
            int k;
            cin >> k;
            for(int i = 1; i + len - 1 <= n; i++){
                cout << cnt[i][k] << " ";
            }
            cout << "\n";
        }
    }
}
namespace sub2{
    void solve(){
        vector<vector<int>>f(n + 2, vector<int>(n + 2, 0));
        for(int i = 1; i <= n; i++){
            for(int j = i + 1; j <= n; j++){
                if(a[i] != a[j]){
                    f[i][j]++;
                    if(i > len){
                        f[i - len][j - len]--;
                    }
                }
            }
        }
        for(int i = n; i > 0; i--){
            for(int j = n; j > i; j--){
                f[i][j] += f[i + 1][j + 1];
            }
        }
        vector<vector<int>>cnt(n - len + 2, vector<int>(len + 1, 0));
        for(int i = 1; i + len - 1 <= n; i++){
            for(int j = i + 1; j + len - 1 <= n; j++){
                cnt[i][f[i][j]]++;
                cnt[j][f[i][j]]++;
            }
        }
        for(int i = 1; i + len - 1 <= n; i++){
            for(int j = 1; j <= len; j++){
                cnt[i][j] += cnt[i][j - 1];
            }
        }
        for(int _ = 0; _ < q; _++){
            int k;
            cin >> k;
            for(int i = 1; i + len - 1 <= n; i++){
                cout << cnt[i][k] << " ";
            }
            cout << "\n";
        }
    }
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
    cin >> n >> len;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    cin >> q;
    if(n <= 300){
        sub1::solve();
    }
    else if(n <= 2000){
        sub2::solve();
    }
}

Compilation message (stderr)

lot.cpp: In function 'int main()':
lot.cpp:79:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |                 freopen(taskname".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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