Submission #77349

#	Time	Username	Problem	Language	Result	Execution time	Memory
77349		duality	Lottery (CEOI18_lot)	C++11	100 / 100	594 ms	10776 KiB

lot

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int a[10000],k[100],s[100];
int pos[10001];
int ans[10000][101];
int main() {
    int i;
    int n,l,q;
    scanf("%d %d",&n,&l);
    for (i = 0; i < n; i++) scanf("%d",&a[i]);
    scanf("%d",&q);
    for (i = 0; i < q; i++) scanf("%d",&k[i]),s[i] = k[i];
    sort(s,s+q);

    int j = 0;
    for (i = 0; i <= l; i++) {
        while ((j < q) && (s[j] < i)) j++;
        pos[i] = j;
    }
    for (i = 1; i <= n-l; i++) {
        int s = 0;
        for (j = 0; j < l; j++) s += (a[j] != a[j+i]);
        ans[0][pos[s]]++,ans[i][pos[s]]++;
        for (j = l; j < n-i; j++) {
            s += (a[j] != a[j+i]) - (a[j-l] != a[j-l+i]);
            ans[j-l+1][pos[s]]++,ans[j-l+i+1][pos[s]]++;
        }
    }
    for (i = 0; i < n; i++) {
        for (j = 1; j <= q; j++) ans[i][j] += ans[i][j-1];
    }
    for (i = 0; i < q; i++) {
        int p = lower_bound(s,s+q,k[i])-s;
        for (j = 0; j <= n-l; j++) printf("%d ",ans[j][p]);
        printf("\n");
    }

    return 0;
}

Compilation message (stderr)

lot.cpp: In function 'int main()':
lot.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&l);
     ~~~~~^~~~~~~~~~~~~~~
lot.cpp:65:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < n; i++) scanf("%d",&a[i]);
                             ~~~~~^~~~~~~~~~~~
lot.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
     ~~~~~^~~~~~~~~
lot.cpp:67:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < q; i++) scanf("%d",&k[i]),s[i] = k[i];
                             ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

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