oj.uz

답안 #718830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
718830 2023-04-05T00:37:10 Z Hacv16 Broken Device (JOI17_broken_device) C++17
0 / 100
 1 ms 520 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

void Anna(int N, ll X, int K, int P[]){
    vector<bool> blocked(N + 1);

    for(int i = 0; i < K; i++){
        int curBit = P[i];
        blocked[curBit] = true;
    }

    int numSame = 1;

    vector<int> goodPos;

    for(int i = 0; i < N; i++){
        if(blocked[i] || (blocked[i + 1])) Set(i, 0);
        else goodPos.push_back(i);
    }

    for(int i = 0, j = 0; i < goodPos.size(); i += 2, j++){
        int pos1 = goodPos[i], pos2 = goodPos[i + 1];
        int bitOn = (bool)((1 << j) & X);

        Set(pos1, 1); Set(pos2, bitOn);
    }
}
#include "Brunolib.h"
#include <bits/stdc++.h>

typedef long long ll;

ll Bruno(int N, int A[]){
  ll ans = 0;

  for(int i = 0, j = 0; i < N; i += 2){
    if(A[i] == 0) continue;
    ans |= (A[i + 1] << j); j++;
  }

  return ans;
}

Compilation message

Anna.cpp: In function 'void Anna(int, ll, int, int*)':
Anna.cpp:24:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int i = 0, j = 0; i < goodPos.size(); i += 2, j++){
      |                           ~~^~~~~~~~~~~~~~~~
Anna.cpp:15:9: warning: unused variable 'numSame' [-Wunused-variable]
   15 |     int numSame = 1;
      |         ^~~~~~~

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 520 KB Wrong Answer [2]
2 Incorrect 0 ms 520 KB Wrong Answer [2]
3 Incorrect 1 ms 520 KB Wrong Answer [2]
4 Incorrect 0 ms 520 KB Wrong Answer [2]
5 Incorrect 0 ms 520 KB Wrong Answer [2]
6 Incorrect 0 ms 520 KB Wrong Answer [2]
7 Incorrect 0 ms 508 KB Wrong Answer [2]
8 Incorrect 0 ms 512 KB Wrong Answer [2]
9 Incorrect 1 ms 520 KB Wrong Answer [2]
10 Incorrect 0 ms 512 KB Wrong Answer [2]
11 Incorrect 0 ms 512 KB Wrong Answer [2]
12 Incorrect 1 ms 512 KB Wrong Answer [2]
13 Incorrect 0 ms 516 KB Wrong Answer [2]
14 Incorrect 0 ms 512 KB Wrong Answer [2]
15 Incorrect 0 ms 512 KB Wrong Answer [2]
16 Incorrect 0 ms 512 KB Wrong Answer [2]
17 Incorrect 0 ms 512 KB Wrong Answer [2]
18 Incorrect 0 ms 516 KB Wrong Answer [2]
19 Incorrect 0 ms 512 KB Wrong Answer [2]
20 Incorrect 0 ms 520 KB Wrong Answer [2]
21 Incorrect 0 ms 520 KB Wrong Answer [2]
22 Incorrect 0 ms 512 KB Wrong Answer [2]
23 Incorrect 0 ms 516 KB Wrong Answer [2]
24 Incorrect 1 ms 512 KB Wrong Answer [2]
25 Incorrect 0 ms 520 KB Wrong Answer [2]
26 Incorrect 0 ms 520 KB Wrong Answer [2]
27 Incorrect 0 ms 520 KB Wrong Answer [2]
28 Incorrect 1 ms 520 KB Wrong Answer [2]
29 Incorrect 0 ms 520 KB Wrong Answer [2]
30 Incorrect 0 ms 520 KB Wrong Answer [2]
31 Incorrect 0 ms 512 KB Wrong Answer [2]
32 Incorrect 0 ms 520 KB Wrong Answer [2]
33 Incorrect 0 ms 520 KB Wrong Answer [2]
34 Incorrect 0 ms 512 KB Wrong Answer [2]
35 Incorrect 0 ms 512 KB Wrong Answer [2]
36 Incorrect 0 ms 512 KB Wrong Answer [2]
37 Incorrect 1 ms 520 KB Wrong Answer [2]
38 Incorrect 0 ms 520 KB Wrong Answer [2]
39 Incorrect 1 ms 520 KB Wrong Answer [2]
40 Incorrect 0 ms 520 KB Wrong Answer [2]