Submission #131576

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
131576	2019-07-17T09:59:06 Z	Osama_Alkhodairy	Broken Device (JOI17_broken_device)	C++17	0 / 100	5 ms	1016 KB

Anna

#include <bits/stdc++.h>
//~ #include "grader.cpp"
//~ #include "Bruno.cpp"
#include "Annalib.h"
using namespace std;

void Anna( int N, long long X, int K, int P[] ){
    vector <int> p;
    for(int i = 0 ; i < K ; i++){
        p.push_back(P[i]);
    }
    int ind = 0;
    for(int i = 59 ; i >= 0 ; i--){
        if(count(p.begin(), p.end(), ind + 1)) Set(ind++, 0);
        while(count(p.begin(), p.end(), ind)) Set(ind++, 0);
        Set(ind, 1);
        ind++;
        Set(ind, (X >> i) & 1);
        ind++;
    }
    while(ind < N) Set(ind++, 0);
}

Bruno

#include <bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
#define ll long long

long long Bruno( int N, int A[] ){
    ll ret = 0;
    int ind = 0;
    while(ind < N){
        if(A[ind] == 0){
            ind++;
            continue;
        }
        ret = ret * 2 + A[ind + 1];
        ind += 2;
    }
    return ret;
}

Subtask #1

0.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	896 KB	Wrong Answer [1]
2	Incorrect	4 ms	936 KB	Wrong Answer [1]
3	Incorrect	4 ms	904 KB	Wrong Answer [1]
4	Incorrect	4 ms	852 KB	Wrong Answer [1]
5	Incorrect	4 ms	768 KB	Wrong Answer [1]
6	Incorrect	4 ms	792 KB	Wrong Answer [1]
7	Incorrect	4 ms	768 KB	Wrong Answer [1]
8	Incorrect	4 ms	1016 KB	Wrong Answer [1]
9	Incorrect	4 ms	768 KB	Wrong Answer [1]
10	Incorrect	4 ms	768 KB	Wrong Answer [1]
11	Incorrect	4 ms	896 KB	Wrong Answer [1]
12	Incorrect	5 ms	768 KB	Wrong Answer [1]
13	Incorrect	4 ms	768 KB	Wrong Answer [1]
14	Incorrect	4 ms	896 KB	Wrong Answer [1]
15	Incorrect	4 ms	652 KB	Wrong Answer [1]
16	Incorrect	4 ms	764 KB	Wrong Answer [1]
17	Incorrect	4 ms	760 KB	Wrong Answer [1]
18	Incorrect	4 ms	768 KB	Wrong Answer [1]
19	Incorrect	4 ms	764 KB	Wrong Answer [1]
20	Incorrect	4 ms	980 KB	Wrong Answer [1]
21	Incorrect	4 ms	1000 KB	Wrong Answer [1]
22	Incorrect	4 ms	856 KB	Wrong Answer [1]
23	Incorrect	4 ms	888 KB	Wrong Answer [1]
24	Incorrect	4 ms	856 KB	Wrong Answer [1]
25	Incorrect	4 ms	888 KB	Wrong Answer [1]
26	Incorrect	4 ms	916 KB	Wrong Answer [1]
27	Incorrect	4 ms	760 KB	Wrong Answer [1]
28	Incorrect	4 ms	988 KB	Wrong Answer [1]
29	Incorrect	3 ms	892 KB	Wrong Answer [1]
30	Incorrect	4 ms	760 KB	Wrong Answer [1]
31	Incorrect	4 ms	764 KB	Wrong Answer [1]
32	Incorrect	4 ms	888 KB	Wrong Answer [1]
33	Incorrect	4 ms	760 KB	Wrong Answer [1]
34	Incorrect	4 ms	760 KB	Wrong Answer [1]
35	Incorrect	4 ms	888 KB	Wrong Answer [1]
36	Incorrect	4 ms	760 KB	Wrong Answer [1]
37	Incorrect	4 ms	760 KB	Wrong Answer [1]
38	Incorrect	4 ms	388 KB	Wrong Answer [1]
39	Incorrect	4 ms	760 KB	Wrong Answer [1]
40	Incorrect	4 ms	768 KB	Wrong Answer [1]