oj.uz

Submission #990651

# Submission time Handle Problem Language Result Execution time Memory
990651 2024-05-30T22:00:03 Z MarwenElarbi Broken Device (JOI17_broken_device) C++17
0 / 100
 23 ms 2724 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
    int tab[N];
    memset(tab,0,sizeof tab);
    for (int i = 0; i < K; ++i)
    {
        tab[P[i]]=-1;
    }
    int convert[65];
    for (int i = 0; i < 64; ++i)
    {
        convert[i]=((1<<i)&X)>0;
        //cout <<convert[i]<<" ";
    }//cout <<endl;
    int lst=0;
    for (int i = 0; i < N-1; ++i)
    {
        if(tab[i]!=-1&&tab[i+1]!=-1){
            tab[i]=(convert[lst]==1);
            tab[i+1]=1;
            lst++;
            i+=2;
        }
    }
    for (int i = 0; i < N; ++i)
    {
        //cout <<tab[i]<<" ";
        if(tab[i]==1) Set(i,1);
        else Set(i,0);
    }//cout <<endl;
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
    int lst=0;
    long long x=0;
    for (int i = 0; i < N-2; ++i)
    {
        if(A[i+1]==1&&A[i+2]!=1){
            if(A[i]==1) x+=(1<<lst);
            lst++;
        }
    }
    if(A[N-1]==1&&A[N-2]==1) x+=(1<<lst);
    //cout <<x<<endl;
    return x;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
2 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
3 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
4 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
5 Partially correct 23 ms 2392 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 2400 KB Output isn't correct - L* = 0
8 Partially correct 20 ms 2504 KB Output isn't correct - L* = 0
9 Partially correct 20 ms 2388 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 2404 KB Output isn't correct - L* = 0
13 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
14 Partially correct 23 ms 2472 KB Output isn't correct - L* = 0
15 Partially correct 20 ms 2404 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 2396 KB Output isn't correct - L* = 0
18 Partially correct 20 ms 2512 KB Output isn't correct - L* = 0
19 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
20 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
21 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
22 Partially correct 23 ms 2372 KB Output isn't correct - L* = 0
23 Partially correct 20 ms 2492 KB Output isn't correct - L* = 0
24 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
25 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
26 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
27 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
28 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
29 Partially correct 20 ms 2496 KB Output isn't correct - L* = 0
30 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
31 Partially correct 20 ms 2392 KB Output isn't correct - L* = 0
32 Partially correct 23 ms 2392 KB Output isn't correct - L* = 0
33 Partially correct 20 ms 2448 KB Output isn't correct - L* = 0
34 Partially correct 20 ms 2404 KB Output isn't correct - L* = 0
35 Partially correct 20 ms 2724 KB Output isn't correct - L* = 0
36 Partially correct 20 ms 2396 KB Output isn't correct - L* = 0
37 Partially correct 20 ms 2480 KB Output isn't correct - L* = 0
38 Partially correct 20 ms 2392 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