oj.uz

답안 #1034992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034992 2024-07-26T02:16:21 Z adaawf Broken Device (JOI17_broken_device) C++17
0 / 100
 1 ms 844 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
int dd[1005];
void Anna(int N, long long int X, int K, int P[]) {
    for (int i = 0; i < N; i++) dd[i] = 0;
    for (int i = 0; i < K; i++) {
        dd[P[i]] = 1;
    }
    vector<int> v;
    int z = 0, t = 0;
    string s = "";
    for (int i = 0; i < 60; i++) {
        if (X & (1ll << i)) {
            s += '1';
        }
        else s += '0';
        Set(i, s[i] - '0');
    }
    z = s.size() - 1;
    while (z >= t) {
        if (s[t] == '0' || dd[t] == 1) {
            if (s[t] == '0') {
                z++;
                s += '1';
                Set(z, 1);
            }
            else {
                z++;
                s += '0';
                Set(z, 0);
            }
        }
        t++;
    }
    for (int i = s.size(); i < N; i++) Set(i, 0);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long int Bruno(int N, int A[]) {
    int z = 0;
    vector<int> v, res(61, 0);
    while (!v.empty()) {
        vector<int> vv;
        for (int i = z; i < z + v.size(); i++) {
            if (A[i] == 0) {
                res[v[i - z]] ^= 1;
                vv.push_back(v[i - z]);
            }
        }
        z += v.size();
        v = vv;
    }
    long long int c = 0;
    for (int i = 0; i < 60; i++) {
        if (res[i] == 1) {
            c += (1ll << i);
        }
    }
    return c;
}

Compilation message

Bruno.cpp: In function 'long long int Bruno(int, int*)':
Bruno.cpp:9:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         for (int i = z; i < z + v.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~

Subtask #1
0.0 / 100.0

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