oj.uz

답안 #1034998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034998 2024-07-26T02:29:23 Z adaawf Broken Device (JOI17_broken_device) C++17
47 / 100
 27 ms 3056 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
int dd[1005], b[1005], z = 0;
/*void Set(int x, int y) {
    if (dd[x] == 1) b[z] = 0;
    else b[z] = y;
    z++;
}*/
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);
            }
        }
        if (z == N - 1) break;
        t++;
    }
    for (int i = s.size(); i < N; i++) Set(i, 1);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long int Bruno(int N, int A[]) {
    int z = 0, flag = 0;
    vector<int> v, res(61, 1);
    for (int i = 0; i < 60; i++) v.push_back(i);
    while (!v.empty()) {
        vector<int> vv;
        for (int i = z; i < z + v.size(); i++) {
            if (i == N) {
                flag = 1;
                break;
            }
            if (A[i] == 0) {
                res[v[i - z]] ^= 1;
                vv.push_back(v[i - z]);
            }
        }
        if (flag == 1) break;
        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:10:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |         for (int i = z; i < z + v.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~

Subtask #1
47.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 26 ms 2860 KB Output is partially correct - L* = 24
2 Partially correct 22 ms 2788 KB Output is partially correct - L* = 20
3 Partially correct 22 ms 3056 KB Output is partially correct - L* = 31
4 Partially correct 22 ms 2952 KB Output is partially correct - L* = 19
5 Partially correct 22 ms 2752 KB Output is partially correct - L* = 28
6 Partially correct 22 ms 2784 KB Output is partially correct - L* = 32
7 Partially correct 22 ms 2776 KB Output is partially correct - L* = 25
8 Partially correct 22 ms 2852 KB Output is partially correct - L* = 25
9 Partially correct 22 ms 2752 KB Output is partially correct - L* = 33
10 Partially correct 23 ms 2776 KB Output is partially correct - L* = 24
11 Partially correct 22 ms 2776 KB Output is partially correct - L* = 25
12 Partially correct 22 ms 2860 KB Output is partially correct - L* = 19
13 Partially correct 23 ms 2784 KB Output is partially correct - L* = 36
14 Partially correct 22 ms 2848 KB Output is partially correct - L* = 23
15 Partially correct 22 ms 2860 KB Output is partially correct - L* = 18
16 Partially correct 24 ms 2888 KB Output is partially correct - L* = 24
17 Partially correct 23 ms 2788 KB Output is partially correct - L* = 24
18 Partially correct 22 ms 2784 KB Output is partially correct - L* = 29
19 Partially correct 22 ms 2772 KB Output is partially correct - L* = 30
20 Partially correct 23 ms 2784 KB Output is partially correct - L* = 31
21 Partially correct 23 ms 2768 KB Output is partially correct - L* = 30
22 Partially correct 22 ms 2812 KB Output is partially correct - L* = 24
23 Partially correct 23 ms 2776 KB Output is partially correct - L* = 26
24 Partially correct 27 ms 2776 KB Output is partially correct - L* = 27
25 Partially correct 22 ms 2772 KB Output is partially correct - L* = 34
26 Partially correct 22 ms 2752 KB Output is partially correct - L* = 26
27 Partially correct 22 ms 2772 KB Output is partially correct - L* = 27
28 Partially correct 22 ms 2772 KB Output is partially correct - L* = 24
29 Partially correct 26 ms 2768 KB Output is partially correct - L* = 29
30 Partially correct 23 ms 2820 KB Output is partially correct - L* = 20
31 Partially correct 26 ms 2880 KB Output is partially correct - L* = 29
32 Partially correct 23 ms 2836 KB Output is partially correct - L* = 25
33 Partially correct 24 ms 2772 KB Output is partially correct - L* = 26
34 Partially correct 22 ms 2744 KB Output is partially correct - L* = 28
35 Partially correct 24 ms 2864 KB Output is partially correct - L* = 30
36 Partially correct 22 ms 2784 KB Output is partially correct - L* = 27
37 Partially correct 22 ms 2776 KB Output is partially correct - L* = 32
38 Partially correct 23 ms 2772 KB Output is partially correct - L* = 25
39 Partially correct 24 ms 2956 KB Output is partially correct - L* = 37
40 Partially correct 23 ms 2864 KB Output is partially correct - L* = 25