oj.uz

Submission #68001

# Submission time Handle Problem Language Result Execution time Memory
68001 2018-08-15T18:04:58 Z elitewantsyou Broken Device (JOI17_broken_device) C++14
0 / 100
 78 ms 13752 KB 
#include <bits/stdc++.h>
#include "Annalib.h"

using namespace std;

int gg[1111];

void Anna( int N, long long X, int K, int P[] )
{
        vector < int > v;
        for(int i = 0; i < K; i++){
                gg[P[i]] = 1;
        }
        for(int i = 1; i < N; i += 2){
                if(gg[i - 1] == 0 && gg[i] == 0 && gg[i + 1] == 0){
                        v.push_back(i);
                }
        }
        for(int i = 0; i < N; i++){
                gg[i] = 0;
        }
        for(int i = 0; i < v.size(); i++){
                gg[v[i] - 1] = gg[v[i] + 1] = 1;
                if(X & (1ll << i)){
                        gg[v[i]] = 1;
                }
        }
        for(int i = 0; i < N; i++){
                Set(i, gg[i]);
        }
}

#include "Brunolib.h"

long long Bruno( int N, int A[] )
{
        long long X = 0;
        int c = 0, g = 0;
        for(int i = 0; i < N; i++){
                if(i % 2 == 0){
                        c += A[i];
                }
                else{
                        if(c % 2){
                                X += (1ll << g) * A[i];
                                g++;
                        }
                }
        }
        return X;
}

Compilation message

Anna.cpp: In function 'void Anna(int, long long int, int, int*)':
Anna.cpp:22:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < v.size(); i++){
                        ~~^~~~~~~~~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 3408 KB Output isn't correct - L* = 0
2 Incorrect 59 ms 4104 KB Output isn't correct - L* = 0
3 Incorrect 50 ms 4496 KB Output isn't correct - L* = 0
4 Incorrect 51 ms 4688 KB Output isn't correct - L* = 0
5 Incorrect 63 ms 5192 KB Output isn't correct - L* = 0
6 Incorrect 66 ms 5440 KB Output isn't correct - L* = 0
7 Incorrect 59 ms 5440 KB Output isn't correct - L* = 0
8 Incorrect 52 ms 5880 KB Output isn't correct - L* = 0
9 Incorrect 54 ms 6280 KB Output isn't correct - L* = 0
10 Incorrect 56 ms 6552 KB Output isn't correct - L* = 0
11 Incorrect 53 ms 6800 KB Output isn't correct - L* = 0
12 Incorrect 49 ms 7064 KB Output isn't correct - L* = 0
13 Incorrect 46 ms 7128 KB Output isn't correct - L* = 0
14 Incorrect 45 ms 7352 KB Output isn't correct - L* = 0
15 Incorrect 61 ms 7592 KB Output isn't correct - L* = 0
16 Incorrect 67 ms 7856 KB Output isn't correct - L* = 0
17 Incorrect 68 ms 8104 KB Output isn't correct - L* = 0
18 Incorrect 48 ms 8320 KB Output isn't correct - L* = 0
19 Incorrect 72 ms 8560 KB Output isn't correct - L* = 0
20 Incorrect 46 ms 8808 KB Output isn't correct - L* = 0
21 Incorrect 52 ms 9312 KB Output isn't correct - L* = 0
22 Incorrect 50 ms 9312 KB Output isn't correct - L* = 0
23 Incorrect 55 ms 9544 KB Output isn't correct - L* = 0
24 Incorrect 52 ms 9952 KB Output isn't correct - L* = 0
25 Incorrect 46 ms 10032 KB Output isn't correct - L* = 0
26 Incorrect 78 ms 10280 KB Output isn't correct - L* = 0
27 Incorrect 52 ms 10680 KB Output isn't correct - L* = 0
28 Incorrect 51 ms 10792 KB Output isn't correct - L* = 0
29 Incorrect 55 ms 11016 KB Output isn't correct - L* = 0
30 Incorrect 57 ms 11256 KB Output isn't correct - L* = 0
31 Incorrect 53 ms 11504 KB Output isn't correct - L* = 0
32 Incorrect 69 ms 11792 KB Output isn't correct - L* = 0
33 Incorrect 77 ms 12040 KB Output isn't correct - L* = 0
34 Incorrect 64 ms 12232 KB Output isn't correct - L* = 0
35 Incorrect 66 ms 12472 KB Output isn't correct - L* = 0
36 Incorrect 54 ms 12720 KB Output isn't correct - L* = 0
37 Incorrect 52 ms 12976 KB Output isn't correct - L* = 0
38 Incorrect 52 ms 13224 KB Output isn't correct - L* = 0
39 Incorrect 57 ms 13496 KB Output isn't correct - L* = 0
40 Incorrect 71 ms 13752 KB Output isn't correct - L* = 0