oj.uz

Submission #1060074

# Submission time Handle Problem Language Result Execution time Memory
1060074 2024-08-15T10:29:28 Z Zbyszek99 Lottery (CEOI18_lot) C++17
25 / 100
 24 ms 1364 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int ans[300][300];

void solve()
{
    int n,l;
    cin >> n >> l;
    int max_s = n-l+1;
    vector<int> v(n);
    rep(i,n) cin >> v[i];
    rep(i,max_s) 
    {
        rep(j,max_s)
        {
            if(i == j) continue;
            int dist = 0;
            rep(k,l)
            {
                if(v[i+k] != v[j+k]) dist++;
            }
            ans[i][j] = dist;
        }
    }
    int q;
    cin >> q;
    rep(qq,q)
    {
        int k;
        cin >> k;
        rep(i,max_s) 
        {
            int a = 0;
            rep(j,max_s)
            {
                if(i == j) continue;
                if(ans[i][j] <= k) a++;
            }
            cout << a << " ";
        }
        cout << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 4 ms 800 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 776 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 4 ms 800 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 776 KB Output is correct
13 Runtime error 5 ms 1112 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 1364 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 1364 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 4 ms 800 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 776 KB Output is correct
13 Runtime error 5 ms 1112 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -