oj.uz

Submission #853812

# Submission time Handle Problem Language Result Execution time Memory
853812 2023-09-25T09:25:40 Z danikoynov Ancient Machine (JOI21_ancient_machine) C++17
69 / 100
 48 ms 8452 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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 780 KB Output is correct
2 Correct 0 ms 796 KB Output is correct
3 Correct 0 ms 796 KB Output is correct
4 Correct 0 ms 796 KB Output is correct
5 Correct 0 ms 792 KB Output is correct
6 Correct 0 ms 792 KB Output is correct
7 Correct 0 ms 1300 KB Output is correct
8 Correct 0 ms 868 KB Output is correct
9 Correct 0 ms 800 KB Output is correct
10 Correct 0 ms 784 KB Output is correct
11 Correct 0 ms 792 KB Output is correct

Subtask #2
64.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 43 ms 8008 KB Partially correct
2 Partially correct 41 ms 8396 KB Partially correct
3 Partially correct 43 ms 8304 KB Partially correct
4 Partially correct 40 ms 8092 KB Partially correct
5 Partially correct 40 ms 8336 KB Partially correct
6 Partially correct 39 ms 8380 KB Partially correct
7 Partially correct 39 ms 8312 KB Partially correct
8 Partially correct 40 ms 8396 KB Partially correct
9 Partially correct 38 ms 8336 KB Partially correct
10 Partially correct 40 ms 8248 KB Partially correct
11 Partially correct 40 ms 8304 KB Partially correct
12 Partially correct 39 ms 8316 KB Partially correct
13 Partially correct 44 ms 8384 KB Partially correct
14 Partially correct 45 ms 8232 KB Partially correct
15 Partially correct 40 ms 8264 KB Partially correct
16 Partially correct 41 ms 8340 KB Partially correct
17 Partially correct 48 ms 8412 KB Partially correct
18 Partially correct 44 ms 8432 KB Partially correct
19 Partially correct 45 ms 8372 KB Partially correct
20 Partially correct 40 ms 8180 KB Partially correct
21 Partially correct 38 ms 8324 KB Partially correct
22 Partially correct 44 ms 8172 KB Partially correct
23 Partially correct 38 ms 8380 KB Partially correct
24 Partially correct 39 ms 8304 KB Partially correct
25 Partially correct 43 ms 8252 KB Partially correct
26 Partially correct 45 ms 8172 KB Partially correct
27 Partially correct 43 ms 8452 KB Partially correct
28 Partially correct 45 ms 8320 KB Partially correct
29 Partially correct 44 ms 8432 KB Partially correct
30 Partially correct 44 ms 8360 KB Partially correct
31 Partially correct 43 ms 8304 KB Partially correct
32 Partially correct 40 ms 8400 KB Partially correct
33 Partially correct 41 ms 8240 KB Partially correct