oj.uz

답안 #1078868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078868 2024-08-28T07:30:37 Z raphaelp Broken Device (JOI17_broken_device) C++14
55 / 100
 35 ms 3092 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;

void Anna(int N, long long X, int K, int P[])
{
    map<vector<int>, vector<int>> M;
    M[{1, 1}] = {1, 1, 1};
    M[{1}] = {1, 1, 0};
    M[{1, 0}] = {1, 0, 1};
    M[{0}] = {1, 0, 0};
    M[{0, 1}] = {0, 1, 1};
    M[{0, 0}] = {0, 1, 0};
    vector<int> P2(N);
    for (int i = 0; i < K; i++)
        P2[P[i]] = 1;
    vector<int> ans(N);
    int buff = 0;
    vector<int> bits;
    while (X)
    {
        bits.push_back(X % 2);
        X /= 2;
    }
    reverse(bits.begin(), bits.end());
    for (int i = 0; i < N; i += 3)
    {
        if (buff == bits.size())
            break;
        vector<int> temp;
        if (P2[i] + P2[i + 1] + P2[i + 2] > 1)
            continue;
        if (P2[i] == 1)
        {
            if (bits[buff] == 1)
            {
                temp = {0, 0, 1};
                buff++;
            }
            else if (buff < bits.size() - 1 && bits[buff] == 0)
            {
                temp = M[{bits[buff], bits[buff + 1]}];
                buff += 2;
            }
        }
        else if (P2[i + 1] == 1)
        {
            if (bits[buff] == 1)
                temp = {0, 0, 1};
            else
                temp = {1, 0, 0};
            buff++;
        }
        else if (P2[i + 2] == 1)
        {
            if (bits[buff] == 1)
                temp = {1, 1, 0};
            else
                temp = {1, 0, 0};
            buff++;
        }
        else
        {
            if (buff < bits.size() - 1)
            {
                temp = M[{bits[buff], bits[buff + 1]}];
                buff += 2;
            }
            else
            {
                temp = M[{bits[buff]}];
                buff++;
            }
        }
        if (!temp.empty())
            ans[i] = temp[0], ans[i + 1] = temp[1], ans[i + 2] = temp[2];
    }
    for (int i = 0; i < N; i++)
    {
        // cout << ans[i] << ' ';
        Set(i, ans[i]);
    }
}
/*int main()
{
    long long N, X, K;
    cin >> N >> X >> K;
    int P[N];
    srand(time(0));
    for (long long i = 0; i < K; i++)
        P[i] = rand() % N;
    Anna(N, X, K, P);
}*/

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno(int N, int A[])
{
    map<vector<int>, vector<int>> M;
    M[{1, 1, 1}] = {1, 1};
    M[{1, 1, 0}] = {1};
    M[{1, 0, 1}] = {1, 0};
    M[{1, 0, 0}] = {0};
    M[{0, 1, 1}] = {0, 1};
    M[{0, 1, 0}] = {0, 0};
    M[{0, 0, 1}] = {1};
    long long X = 0;
    for (int i = 0; i < N; i += 3)
    {
        vector<int> temp = {A[i], A[i + 1], A[i + 2]};
        if (temp[0] + temp[1] + temp[2] == 0)
            continue;
        else
            temp = M[temp];
        for (int j = 0; j < temp.size(); j++)
        {
            X *= 2;
            X += temp[j];
        }
    }
    return X;
}
/*int main()
{
    int N;
    cin >> N;
    int A[N];
    for (int i = 0; i < N; i++)
        cin >> A[i];
    cout << Bruno(N, A);
}*/

Compilation message

Anna.cpp: In function 'void Anna(int, long long int, int, int*)':
Anna.cpp:28:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         if (buff == bits.size())
      |             ~~~~~^~~~~~~~~~~~~~
Anna.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             else if (buff < bits.size() - 1 && bits[buff] == 0)
      |                      ~~~~~^~~~~~~~~~~~~~~~~
Anna.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |             if (buff < bits.size() - 1)
      |                 ~~~~~^~~~~~~~~~~~~~~~~

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

Subtask #1
55.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 24 ms 2772 KB Output is partially correct - L* = 28
2 Partially correct 30 ms 2752 KB Output is partially correct - L* = 37
3 Partially correct 23 ms 2808 KB Output is partially correct - L* = 39
4 Correct 25 ms 2772 KB Output is correct - L* = 40
5 Correct 30 ms 2776 KB Output is correct - L* = 40
6 Correct 25 ms 2840 KB Output is correct - L* = 40
7 Correct 35 ms 2680 KB Output is correct - L* = 40
8 Correct 26 ms 2752 KB Output is correct - L* = 40
9 Correct 24 ms 2860 KB Output is correct - L* = 40
10 Correct 26 ms 2776 KB Output is correct - L* = 40
11 Correct 25 ms 2776 KB Output is correct - L* = 40
12 Correct 25 ms 2772 KB Output is correct - L* = 40
13 Partially correct 25 ms 2776 KB Output is partially correct - L* = 32
14 Correct 25 ms 2724 KB Output is correct - L* = 40
15 Correct 31 ms 3092 KB Output is correct - L* = 40
16 Correct 26 ms 2732 KB Output is correct - L* = 40
17 Correct 26 ms 2772 KB Output is correct - L* = 40
18 Partially correct 24 ms 2768 KB Output is partially correct - L* = 37
19 Partially correct 26 ms 2780 KB Output is partially correct - L* = 22
20 Correct 26 ms 2784 KB Output is correct - L* = 40
21 Partially correct 25 ms 2860 KB Output is partially correct - L* = 37
22 Correct 25 ms 2768 KB Output is correct - L* = 40
23 Correct 26 ms 2776 KB Output is correct - L* = 40
24 Correct 24 ms 2776 KB Output is correct - L* = 40
25 Correct 25 ms 2776 KB Output is correct - L* = 40
26 Correct 26 ms 2876 KB Output is correct - L* = 40
27 Correct 24 ms 2944 KB Output is correct - L* = 40
28 Correct 25 ms 2856 KB Output is correct - L* = 40
29 Partially correct 25 ms 2748 KB Output is partially correct - L* = 37
30 Correct 25 ms 2776 KB Output is correct - L* = 40
31 Correct 25 ms 2780 KB Output is correct - L* = 40
32 Partially correct 24 ms 2752 KB Output is partially correct - L* = 39
33 Correct 27 ms 2776 KB Output is correct - L* = 40
34 Correct 26 ms 2848 KB Output is correct - L* = 40
35 Correct 25 ms 2832 KB Output is correct - L* = 40
36 Correct 25 ms 2868 KB Output is correct - L* = 40
37 Partially correct 24 ms 2776 KB Output is partially correct - L* = 38
38 Correct 23 ms 2768 KB Output is correct - L* = 40
39 Partially correct 25 ms 2760 KB Output is partially correct - L* = 39
40 Correct 24 ms 2784 KB Output is correct - L* = 40