oj.uz

Submission #1029781

# Submission time Handle Problem Language Result Execution time Memory
1029781 2024-07-21T10:22:42 Z borisAngelov Broken Device (JOI17_broken_device) C++17
0 / 100
 26 ms 2556 KB 
#include "Annalib.h"
#include <bits/stdc++.h>

using namespace std;

int n, k;
long long x;
bool isBlocked[200];

void Anna(int N, long long X, int K, int P[])
{
    n = N;
    x = X;
    k = K;

    for (int i = 0; i < k; ++i)
    {
        isBlocked[P[i]] = true;
    }

    int bit = 0;

    for (int i = 0; i < n; ++i)
    {
        if (i < n - 2 && isBlocked[i] == false && isBlocked[i + 1] == false)
        {
            if ((x & (1LL << bit)) != 0)
            {
                Set(i, 1);
            }
            else
            {
                Set(i, 0);
            }

            Set(i + 1, 1);
            Set(i + 2, 0);
            i += 2;
            ++bit;
        }
        else
        {
            Set(i, 0);
        }
    }
}

#include "Brunolib.h"
#include <bits/stdc++.h>

using namespace std;

int a[200];

long long Bruno(int N, int A[])
{
    int n = N;

    for (int i = 0; i < n; ++i)
    {
        a[i] = A[i];
        //cout << a[i] << " ";
    }

    //cout << endl;

    long long ans = 0;
    int bit = 0;

    for (int i = 0; i < n; ++i)
    {
        if (a[i] == 1)
        {
            if (i < n - 1 && a[i + 1] == 1)
            {
                ans += (1LL << bit);
                //cout << i << " " << bit << endl;
                i += 2;
            }

            ++bit;
        }
    }

    //cout << ans << endl;

    return ans;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 20 ms 2468 KB Output isn't correct - L* = 0
2 Partially correct 20 ms 2472 KB Output isn't correct - L* = 0
3 Partially correct 20 ms 2512 KB Output isn't correct - L* = 0
4 Partially correct 22 ms 2388 KB Output isn't correct - L* = 0
5 Partially correct 20 ms 2484 KB Output isn't correct - L* = 0
6 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
7 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
8 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
9 Partially correct 23 ms 2396 KB Output isn't correct - L* = 0
10 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
11 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
12 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
13 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
14 Partially correct 20 ms 2400 KB Output isn't correct - L* = 0
15 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
16 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
17 Partially correct 20 ms 2480 KB Output isn't correct - L* = 0
18 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
19 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
20 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
21 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
22 Partially correct 20 ms 2524 KB Output isn't correct - L* = 0
23 Partially correct 22 ms 2404 KB Output isn't correct - L* = 0
24 Partially correct 26 ms 2464 KB Output isn't correct - L* = 0
25 Partially correct 22 ms 2404 KB Output isn't correct - L* = 0
26 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
27 Partially correct 22 ms 2440 KB Output isn't correct - L* = 0
28 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
29 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
30 Partially correct 26 ms 2460 KB Output isn't correct - L* = 0
31 Partially correct 18 ms 2556 KB Output isn't correct - L* = 0
32 Partially correct 19 ms 2396 KB Output isn't correct - L* = 0
33 Partially correct 18 ms 2404 KB Output isn't correct - L* = 0
34 Partially correct 19 ms 2500 KB Output isn't correct - L* = 0
35 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
36 Partially correct 23 ms 2396 KB Output isn't correct - L* = 0
37 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
38 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
39 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
40 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0