oj.uz

Submission #313382

# Submission time Handle Problem Language Result Execution time Memory
313382 2020-10-15T22:57:57 Z ly20 Broken Device (JOI17_broken_device) C++17
0 / 100
 51 ms 3328 KB 
#include "Annalib.h"

void Anna( int N, long long X, int K, int P[] ){
    bool rs[200], marc[200];
    int n = N, k = K;
    for(int i = 0; i < n; i++) {
        rs[i] = 0;
        marc[i] = 0;
    }
    for(int i = 0; i < k; i++) {
        marc[P[i]] = 1;
    }
    long long pot = 59;
    for(int i = 0; i < n - 1; i++) {
        if(pot < 0) break;
        if(marc[i] = 0 && marc[i + 1] == 0) {
            rs[i] = 1;
            if((1LL << pot) & X) rs[i + 1] = 1;
            else rs[i + 1] = 0;
            i++;
            pot--;
        }
    }
    for( int i = 0; i < N; i++ ){
        Set( i, rs[i] );
    }
}

#include "Brunolib.h"

long long Bruno( int N, int A[] ){
  long long  pot = 59;
  long long resp = 0;
  for(int i = 0; i < N - 1; i++) {
    if(pot < 0) break;
    if(A[i] == 1) {
        resp += ((long long) A[i + 1] << pot);
        i++;
        pot--;
    }
  }

  return resp;
}

Compilation message

Anna.cpp: In function 'void Anna(int, long long int, int, int*)':
Anna.cpp:16:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   16 |         if(marc[i] = 0 && marc[i + 1] == 0) {
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 45 ms 3056 KB Output isn't correct - L* = 0
2 Partially correct 41 ms 3072 KB Output isn't correct - L* = 0
3 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
4 Partially correct 41 ms 2800 KB Output isn't correct - L* = 0
5 Partially correct 41 ms 3072 KB Output isn't correct - L* = 0
6 Partially correct 43 ms 3056 KB Output isn't correct - L* = 0
7 Partially correct 51 ms 3056 KB Output isn't correct - L* = 0
8 Partially correct 43 ms 3136 KB Output isn't correct - L* = 0
9 Partially correct 41 ms 2880 KB Output isn't correct - L* = 0
10 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
11 Partially correct 45 ms 3072 KB Output isn't correct - L* = 0
12 Partially correct 44 ms 3056 KB Output isn't correct - L* = 0
13 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
14 Partially correct 44 ms 3056 KB Output isn't correct - L* = 0
15 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
16 Partially correct 43 ms 3056 KB Output isn't correct - L* = 0
17 Partially correct 44 ms 3064 KB Output isn't correct - L* = 0
18 Partially correct 44 ms 3072 KB Output isn't correct - L* = 0
19 Partially correct 43 ms 2880 KB Output isn't correct - L* = 0
20 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
21 Partially correct 41 ms 3072 KB Output isn't correct - L* = 0
22 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
23 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
24 Partially correct 43 ms 3232 KB Output isn't correct - L* = 0
25 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
26 Partially correct 41 ms 3072 KB Output isn't correct - L* = 0
27 Partially correct 45 ms 3056 KB Output isn't correct - L* = 0
28 Partially correct 41 ms 3064 KB Output isn't correct - L* = 0
29 Partially correct 45 ms 3072 KB Output isn't correct - L* = 0
30 Partially correct 45 ms 3056 KB Output isn't correct - L* = 0
31 Partially correct 46 ms 3072 KB Output isn't correct - L* = 0
32 Partially correct 44 ms 3056 KB Output isn't correct - L* = 0
33 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
34 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
35 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
36 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
37 Partially correct 43 ms 3312 KB Output isn't correct - L* = 0
38 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
39 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
40 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0