oj.uz

Submission #853810

# Submission time Handle Problem Language Result Execution time Memory
853810 2023-09-25T09:25:03 Z danikoynov Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 38 ms 8300 KB 
#include "Anna.h"
#include <vector>
#include <bits/stdc++.h>


namespace
{



}

std::vector < int > binary_to_fibonacci(std::vector < int > seq)
{

}

void Anna(int N, std::vector<char> S)
{
    for (int i = 0; i < N; i ++)
    {
        if (S[i] == 'Z' && (i == 0 || S[i - 1] != 'Z'))
            Send(1);
        else
            Send(0);
    }
    int pt = 0;
    while(pt < N && S[pt] != 'X')
        pt ++;
    for (int bit = 0; bit < 20; bit ++)
    {
        if ((pt & (1 << bit)) > 0)
            Send(1);
        else
            Send(0);
    }

}

#include "Bruno.h"
#include <vector>
#include <iostream>
namespace
{
const int maxn = 1e5 + 10;
int variable_example = 0;

int FunctionExample(int P)
{
    return 1 - P;
}
char c[maxn];
}  // namespace

void sub_solve()
{

}
void Bruno(int N, int L, std::vector<int> A)
{
    int pt = 0;
    for (int bit = 0; bit < 20; bit ++)
    {
        pt = pt + A[bit + N] * (1 << bit);
    }

    for (int i = 0; i < pt; i ++)
        Remove(i);

    std::vector < int > zpos;
    for (int i = pt; i < N; i ++)
    {
        if (A[i] == 1)
            zpos.push_back(i);
    }


    int last = pt;
    for (int i = 0; i < zpos.size(); i ++)
    {
        for (int j = zpos[i] - 1; j > last; j --)
            Remove(j);
        Remove(zpos[i]);
        last = zpos[i];
    }

    for (int i = N - 1; i > last; i --)
        Remove(i);
    if (pt != N)
        Remove(pt);

    /**for (int i = 0; i < N; i ++)
        std::cout << c[i] << " ";
    std::cout << std::endl;*/
}

Compilation message

Anna.cpp: In function 'std::vector<int> binary_to_fibonacci(std::vector<int>)':
Anna.cpp:16:1: warning: no return statement in function returning non-void [-Wreturn-type]
   16 | }
      | ^

Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:40:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for (int i = 0; i < zpos.size(); i ++)
      |                     ~~^~~~~~~~~~~~~
Bruno.cpp: At global scope:
Bruno.cpp:13:6: warning: '{anonymous}::c' defined but not used [-Wunused-variable]
   13 | char c[maxn];
      |      ^
Bruno.cpp:9:5: warning: 'int {anonymous}::FunctionExample(int)' defined but not used [-Wunused-function]
    9 | int FunctionExample(int P)
      |     ^~~~~~~~~~~~~~~
Bruno.cpp:7:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    7 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 784 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 8300 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -