oj.uz

Submission #852135

# Submission time Handle Problem Language Result Execution time Memory
852135 2023-09-21T09:52:09 Z Rafi22 Broken Device (JOI17_broken_device) C++14
0 / 100
 43 ms 2928 KB 
#include <bits/stdc++.h>
#include "Annalib.h"

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
//int inf=1000000007;
//int mod=1000000007;
//int mod1=998244353;

bool bad[157];
int res[157];

void Anna(int n,ll x,int k,int P[])
{
    for(int i=0;i<150;i++)
    {
        bad[i]=0;
        res[i]=0;
    }
    for(int i=0;i<k;i++) bad[P[i]]=1;
    srand(2137);
    vector<int>X;
    for(int i=59;i>=0;i--)
    {
        X.pb(i);
        X.pb(i);
    }
    while(sz(X)<150) X.pb(0);
    random_shuffle(all(X));
    for(int i=59;i>=0;i--)
    {
        for(int j=0;j<150;j++)
        {
            if(X[j]==i&&!bad[j]&&x>=(1LL<<j))
            {
                res[j]=1;
                x-=(1LL<<j);
            }
        }
    }
    for(int i=0;i<150;i++) Set(i,res[i]);
}


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

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
//int inf=1000000007;
//int mod=1000000007;
//int mod1=998244353;

ll Bruno(int n,int a[])
{
    srand(2137);
    vector<int>X;
    for(int i=59;i>=0;i--)
    {
        X.pb(i);
        X.pb(i);
    }
    while(sz(X)<150) X.pb(0);
    random_shuffle(all(X));
    ll wyn=0;
    for(int i=0;i<150;i++)
    {
        if(a[i]==1) wyn+=(1LL<<X[i]);
    }
    return wyn;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 37 ms 2652 KB Output isn't correct - L* = 0
2 Partially correct 36 ms 2680 KB Output isn't correct - L* = 0
3 Partially correct 36 ms 2928 KB Output isn't correct - L* = 0
4 Partially correct 36 ms 2672 KB Output isn't correct - L* = 0
5 Partially correct 37 ms 2772 KB Output isn't correct - L* = 0
6 Partially correct 41 ms 2676 KB Output isn't correct - L* = 0
7 Partially correct 34 ms 2676 KB Output isn't correct - L* = 0
8 Partially correct 37 ms 2772 KB Output isn't correct - L* = 0
9 Partially correct 37 ms 2680 KB Output isn't correct - L* = 0
10 Partially correct 36 ms 2684 KB Output isn't correct - L* = 0
11 Partially correct 37 ms 2652 KB Output isn't correct - L* = 0
12 Partially correct 42 ms 2684 KB Output isn't correct - L* = 0
13 Partially correct 37 ms 2880 KB Output isn't correct - L* = 0
14 Partially correct 36 ms 2636 KB Output isn't correct - L* = 0
15 Partially correct 37 ms 2684 KB Output isn't correct - L* = 0
16 Partially correct 43 ms 2676 KB Output isn't correct - L* = 0
17 Partially correct 38 ms 2676 KB Output isn't correct - L* = 0
18 Partially correct 34 ms 2848 KB Output isn't correct - L* = 0
19 Partially correct 36 ms 2732 KB Output isn't correct - L* = 0
20 Partially correct 36 ms 2676 KB Output isn't correct - L* = 0
21 Partially correct 36 ms 2768 KB Output isn't correct - L* = 0
22 Partially correct 34 ms 2780 KB Output isn't correct - L* = 0
23 Partially correct 34 ms 2680 KB Output isn't correct - L* = 0
24 Partially correct 40 ms 2676 KB Output isn't correct - L* = 0
25 Partially correct 36 ms 2744 KB Output isn't correct - L* = 0
26 Partially correct 36 ms 2828 KB Output isn't correct - L* = 0
27 Partially correct 36 ms 2676 KB Output isn't correct - L* = 0
28 Partially correct 39 ms 2672 KB Output isn't correct - L* = 0
29 Partially correct 39 ms 2692 KB Output isn't correct - L* = 0
30 Partially correct 36 ms 2680 KB Output isn't correct - L* = 0
31 Partially correct 36 ms 2676 KB Output isn't correct - L* = 0
32 Partially correct 38 ms 2692 KB Output isn't correct - L* = 0
33 Partially correct 36 ms 2676 KB Output isn't correct - L* = 0
34 Partially correct 37 ms 2680 KB Output isn't correct - L* = 0
35 Partially correct 36 ms 2800 KB Output isn't correct - L* = 0
36 Partially correct 40 ms 2716 KB Output isn't correct - L* = 0
37 Partially correct 37 ms 2776 KB Output isn't correct - L* = 0
38 Partially correct 36 ms 2676 KB Output isn't correct - L* = 0
39 Partially correct 36 ms 2716 KB Output isn't correct - L* = 0
40 Partially correct 37 ms 2728 KB Output isn't correct - L* = 0