제출 #398018

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398018		Victor	Lottery (CEOI18_lot)	C++17	100 / 100	984 ms	6852 KiB

lot

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    short n, l, q, mismatch[10003], groups, queryval[101], valtoidx[10003];
    memset(valtoidx, -1, sizeof(valtoidx));
    int arr[10003];
    cin >> n >> l;
    groups = n - l + 1;
    rep(i, 0, n) cin >> arr[i];

    cin >> q;
    vector<short> queries;
    queries.pb(l + 1);

    rep(i, 0, q) {
        cin >> queryval[i];
        queries.pb(queryval[i]);
    }

    sort(all(queries));
    queries.erase(unique(all(queries)), queries.end());

    int pos=0,x=0;
    trav(query,queries){
        rep(i,pos,query+1)valtoidx[i]=x;
        ++x;
        pos=query+1;
    }

    vector<vector<short>> ans(groups, vector<short>(sz(queries)));
    memset(mismatch, 0, sizeof(mismatch));

    rep(i, 0, l) rep(j, i + 1, groups + i) if (arr[i] != arr[j])++ mismatch[j - i];

    rep(i, 0, groups) {
        rep(j, 1, groups - i) {
            short idx = valtoidx[mismatch[j]];

            ++ans[i][idx];
            ++ans[j + i][idx];
        }

        rep(j, i + 1, min(int(n), groups + i)) if (arr[i] != arr[j])-- mismatch[j - i];

        rep(j, i + l + 1, n) if (arr[i + l] != arr[j])++ mismatch[j - i - l];
    }

    rep(i, 0, groups) rep(j, 1, sz(queries)) ans[i][j] += ans[i][j - 1];

    rep(i, 0, q) {
        short idx = valtoidx[queryval[i]];

        rep(j, 0, groups) cout << ans[j][idx] << ' ';
        cout << "\n";
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

lot.cpp: In function 'int main()':
lot.cpp:5:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
lot.cpp:73:23: note: in expansion of macro 'rep'
   73 |     rep(i, 0, groups) rep(j, 1, sz(queries)) ans[i][j] += ans[i][j - 1];
      |                       ^~~

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