oj.uz

Submission #121054

# Submission time Handle Problem Language Result Execution time Memory
121054 2019-06-26T04:14:45 Z BThero Lottery (CEOI18_lot) C++17
45 / 100
 123 ms 31912 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MAXN = (int)2e3 + 5;

int diff[MAXN][MAXN];

int ans[MAXN][MAXN];

int arr[MAXN];

int n, l, q;

void solve() {
    scanf("%d %d", &n, &l);

    for (int i = 1; i <= n; ++i) {
        scanf("%d", &arr[i]);
    }

    for (int i = 1; i <= n; ++i) {
        for (int j = i + 1; j <= n; ++j) {
            if (arr[i] != arr[j]) {
                ++diff[i][j];

                if (i > l) {
                    --diff[i - l][j - l];
                }
            }
        }
    }

    for (int i = n - 1; i > 0; --i) {
        for (int j = i + 1; j < n; ++j) {
            diff[i][j] += diff[i + 1][j + 1];
        }
    }    

    for (int i = 1; i + l - 1 <= n; ++i) {
        for (int j = i + 1; j + l - 1 <= n; ++j) {
            ++ans[i][diff[i][j]];
            ++ans[j][diff[i][j]];
        }
    }

    for (int i = 1; i + l - 1 <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            ans[i][j] += ans[i][j - 1];
        }
    }

    scanf("%d", &q);

    for (int i = 1; i <= q; ++i) {
        int k;
        scanf("%d", &k);

        for (int j = 1; j + l - 1 <= n; ++j) {
            printf("%d ", ans[j][k]);
        }

        printf("\n");
    }
}

int main() {
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

lot.cpp: In function 'void solve()':
lot.cpp:36: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:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~
lot.cpp:73:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &q);
     ~~~~~^~~~~~~~~~
lot.cpp:77:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &k);
         ~~~~~^~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 1024 KB Output is correct
3 Correct 3 ms 1152 KB Output is correct
4 Correct 2 ms 1024 KB Output is correct
5 Correct 2 ms 1024 KB Output is correct
6 Correct 3 ms 1152 KB Output is correct
7 Correct 3 ms 1152 KB Output is correct
8 Correct 4 ms 2432 KB Output is correct
9 Correct 4 ms 2560 KB Output is correct
10 Correct 5 ms 3200 KB Output is correct
11 Correct 5 ms 3200 KB Output is correct
12 Correct 4 ms 3072 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 1024 KB Output is correct
3 Correct 3 ms 1152 KB Output is correct
4 Correct 2 ms 1024 KB Output is correct
5 Correct 2 ms 1024 KB Output is correct
6 Correct 3 ms 1152 KB Output is correct
7 Correct 3 ms 1152 KB Output is correct
8 Correct 4 ms 2432 KB Output is correct
9 Correct 4 ms 2560 KB Output is correct
10 Correct 5 ms 3200 KB Output is correct
11 Correct 5 ms 3200 KB Output is correct
12 Correct 4 ms 3072 KB Output is correct
13 Correct 46 ms 29816 KB Output is correct
14 Correct 37 ms 24696 KB Output is correct
15 Correct 36 ms 24700 KB Output is correct
16 Correct 51 ms 28280 KB Output is correct
17 Correct 44 ms 27384 KB Output is correct
18 Correct 45 ms 27292 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 123 ms 31912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 123 ms 31912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 1024 KB Output is correct
3 Correct 3 ms 1152 KB Output is correct
4 Correct 2 ms 1024 KB Output is correct
5 Correct 2 ms 1024 KB Output is correct
6 Correct 3 ms 1152 KB Output is correct
7 Correct 3 ms 1152 KB Output is correct
8 Correct 4 ms 2432 KB Output is correct
9 Correct 4 ms 2560 KB Output is correct
10 Correct 5 ms 3200 KB Output is correct
11 Correct 5 ms 3200 KB Output is correct
12 Correct 4 ms 3072 KB Output is correct
13 Correct 46 ms 29816 KB Output is correct
14 Correct 37 ms 24696 KB Output is correct
15 Correct 36 ms 24700 KB Output is correct
16 Correct 51 ms 28280 KB Output is correct
17 Correct 44 ms 27384 KB Output is correct
18 Correct 45 ms 27292 KB Output is correct
19 Runtime error 123 ms 31912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -