oj.uz

답안 #77349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77349 2018-09-26T00:23:34 Z duality Lottery (CEOI18_lot) C++11
100 / 100
 594 ms 10776 KB 
#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

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.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 2 ms 796 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Correct 3 ms 964 KB Output is correct
12 Correct 3 ms 964 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 2 ms 796 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Correct 3 ms 964 KB Output is correct
12 Correct 3 ms 964 KB Output is correct
13 Correct 17 ms 1480 KB Output is correct
14 Correct 12 ms 1508 KB Output is correct
15 Correct 11 ms 1528 KB Output is correct
16 Correct 17 ms 1676 KB Output is correct
17 Correct 15 ms 1696 KB Output is correct
18 Correct 15 ms 1696 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 487 ms 4840 KB Output is correct
2 Correct 496 ms 4972 KB Output is correct
3 Correct 482 ms 4992 KB Output is correct
4 Correct 446 ms 5016 KB Output is correct
5 Correct 139 ms 5116 KB Output is correct
6 Correct 412 ms 5220 KB Output is correct
7 Correct 141 ms 5316 KB Output is correct
8 Correct 254 ms 5416 KB Output is correct
9 Correct 439 ms 5520 KB Output is correct
10 Correct 462 ms 5612 KB Output is correct
11 Correct 18 ms 5612 KB Output is correct
12 Correct 249 ms 5612 KB Output is correct
13 Correct 196 ms 5780 KB Output is correct
14 Correct 208 ms 5908 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 487 ms 4840 KB Output is correct
2 Correct 496 ms 4972 KB Output is correct
3 Correct 482 ms 4992 KB Output is correct
4 Correct 446 ms 5016 KB Output is correct
5 Correct 139 ms 5116 KB Output is correct
6 Correct 412 ms 5220 KB Output is correct
7 Correct 141 ms 5316 KB Output is correct
8 Correct 254 ms 5416 KB Output is correct
9 Correct 439 ms 5520 KB Output is correct
10 Correct 462 ms 5612 KB Output is correct
11 Correct 18 ms 5612 KB Output is correct
12 Correct 249 ms 5612 KB Output is correct
13 Correct 196 ms 5780 KB Output is correct
14 Correct 208 ms 5908 KB Output is correct
15 Correct 453 ms 5916 KB Output is correct
16 Correct 398 ms 6032 KB Output is correct
17 Correct 470 ms 6116 KB Output is correct
18 Correct 453 ms 6232 KB Output is correct
19 Correct 458 ms 6332 KB Output is correct
20 Correct 470 ms 6436 KB Output is correct
21 Correct 456 ms 6480 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 620 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 776 KB Output is correct
9 Correct 2 ms 796 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Correct 3 ms 964 KB Output is correct
12 Correct 3 ms 964 KB Output is correct
13 Correct 17 ms 1480 KB Output is correct
14 Correct 12 ms 1508 KB Output is correct
15 Correct 11 ms 1528 KB Output is correct
16 Correct 17 ms 1676 KB Output is correct
17 Correct 15 ms 1696 KB Output is correct
18 Correct 15 ms 1696 KB Output is correct
19 Correct 487 ms 4840 KB Output is correct
20 Correct 496 ms 4972 KB Output is correct
21 Correct 482 ms 4992 KB Output is correct
22 Correct 446 ms 5016 KB Output is correct
23 Correct 139 ms 5116 KB Output is correct
24 Correct 412 ms 5220 KB Output is correct
25 Correct 141 ms 5316 KB Output is correct
26 Correct 254 ms 5416 KB Output is correct
27 Correct 439 ms 5520 KB Output is correct
28 Correct 462 ms 5612 KB Output is correct
29 Correct 18 ms 5612 KB Output is correct
30 Correct 249 ms 5612 KB Output is correct
31 Correct 196 ms 5780 KB Output is correct
32 Correct 208 ms 5908 KB Output is correct
33 Correct 453 ms 5916 KB Output is correct
34 Correct 398 ms 6032 KB Output is correct
35 Correct 470 ms 6116 KB Output is correct
36 Correct 453 ms 6232 KB Output is correct
37 Correct 458 ms 6332 KB Output is correct
38 Correct 470 ms 6436 KB Output is correct
39 Correct 456 ms 6480 KB Output is correct
40 Correct 499 ms 7400 KB Output is correct
41 Correct 23 ms 7400 KB Output is correct
42 Correct 484 ms 7400 KB Output is correct
43 Correct 488 ms 7400 KB Output is correct
44 Correct 452 ms 7400 KB Output is correct
45 Correct 594 ms 10592 KB Output is correct
46 Correct 30 ms 10592 KB Output is correct
47 Correct 581 ms 10776 KB Output is correct
48 Correct 536 ms 10776 KB Output is correct
49 Correct 542 ms 10776 KB Output is correct