oj.uz

Submission #132639

# Submission time Handle Problem Language Result Execution time Memory
132639 2019-07-19T09:12:46 Z SamAnd Lottery (CEOI18_lot) C++17
25 / 100
 165 ms 47864 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2003;

int n, m;
int a[N];
vector<int> v[N];

int b[N][N];
void ubd(int x1, int x2, int y1, int y2)
{
    b[x1][y1]++;
    b[x2 + 1][y2 + 1]--;
}
int p[N][N];

int main()
{
    //freopen("input.txt", "r", stdin);
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            if (a[i] != a[j])
            {
                int x1 = i - m + 1;
                int x2 = i;
                int y1 = j - m + 1;
                int y2 = j;
                int t1 = 0, t2 = 0;
                t1 = max(t1, 1 - x1);
                t2 = max(t2, x2 - (n - m + 1));
                t1 = max(t1, 1 - y1);
                t2 = max(t2, y2 - (n - m + 1));
                x1 += t1;
                y1 += t1;
                x2 -= t2;
                y2 -= t2;
                ubd(x1, x2, y1, y2);
            }
        }
    }
    for (int i = 1; i <= n - m + 1; ++i)
    {
        for (int j = 1; j <= n - m + 1; ++j)
        {
            p[i][j] = p[i - 1][j - 1] + b[i][j];
            if (i != j)
            {
                v[i].push_back(p[i][j]);
            }
        }
    }
    for (int i = 1; i <= n - m + 1; ++i)
        sort(v[i].begin(), v[i].end());
    int q;
    scanf("%d", &q);
    while (q--)
    {
        int d;
        scanf("%d", &d);
        for (int i = 1; i <= n - m + 1; ++i)
        {
            printf("%d ", upper_bound(v[i].begin(), v[i].end(), d) - v[i].begin());
        }
        printf("\n");
    }
    return 0;
}

Compilation message

lot.cpp: In function 'int main()':
lot.cpp:67:82: warning: format '%d' expects argument of type 'int', but argument 2 has type '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type {aka long int}' [-Wformat=]
             printf("%d ", upper_bound(v[i].begin(), v[i].end(), d) - v[i].begin());
                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
lot.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
lot.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~
lot.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &q);
     ~~~~~^~~~~~~~~~
lot.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &d);
         ~~~~~^~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 6 ms 3192 KB Output is correct
9 Correct 7 ms 3064 KB Output is correct
10 Correct 8 ms 3960 KB Output is correct
11 Correct 8 ms 3960 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 6 ms 3192 KB Output is correct
9 Correct 7 ms 3064 KB Output is correct
10 Correct 8 ms 3960 KB Output is correct
11 Correct 8 ms 3960 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct
13 Runtime error 165 ms 47864 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 3 ms 1272 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 3 ms 1272 KB Output is correct
7 Correct 3 ms 1272 KB Output is correct
8 Correct 6 ms 3192 KB Output is correct
9 Correct 7 ms 3064 KB Output is correct
10 Correct 8 ms 3960 KB Output is correct
11 Correct 8 ms 3960 KB Output is correct
12 Correct 7 ms 3832 KB Output is correct
13 Runtime error 165 ms 47864 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
14 Halted 0 ms 0 KB -