oj.uz

Submission #930852

# Submission time Handle Problem Language Result Execution time Memory
930852 2024-02-20T13:50:02 Z boris_mihov Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 47 ms 8688 KB 
#include "Anna.h"
#include <vector>


void Anna(int N, std::vector <char> s) 
{
    bool foundX = false;
    for (int i = 0 ; i < N ; ++i)
    {
        if (!foundX && s[i] == 'X')
        {
            foundX = true;
            Send(1);
        } else if (foundX && s[i] == 'Z')
        {
            Send(1);
        } else
        {
            Send(0);
        }
    }
}

#include "Bruno.h"
#include <vector>

void Bruno(int N, int L, std::vector <int> A) 
{
    int xPos = -1;
    std::vector <int> pos;
    for (int i = 0 ; i < N ; ++i)
    {
        if (A[i] == 1)
        {
            if (xPos == -1) xPos = i;
            pos.push_back(i);
        }
    }

    if (pos.empty())
    {
        for (int i = 0 ; i < N ; ++i)
        {
            Remove(i);
        }

        return;
    }
    
    if (pos.back() < N - 1) pos.push_back(N - 1);
    for (int i = 0 ; i < xPos ; ++i)
    {
        Remove(i);
    }

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

        Remove(pos[i]);
    }

    Remove(pos[0]);
}

Compilation message

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

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 784 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 0 ms 792 KB Output is correct
5 Correct 0 ms 792 KB Output is correct
6 Correct 1 ms 788 KB Output is correct
7 Correct 0 ms 776 KB Output is correct
8 Correct 0 ms 780 KB Output is correct
9 Correct 0 ms 780 KB Output is correct
10 Correct 0 ms 788 KB Output is correct
11 Correct 0 ms 780 KB Output is correct

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 40 ms 7928 KB Partially correct
2 Partially correct 38 ms 7776 KB Partially correct
3 Partially correct 44 ms 7840 KB Partially correct
4 Partially correct 39 ms 7900 KB Partially correct
5 Partially correct 39 ms 7844 KB Partially correct
6 Partially correct 40 ms 7888 KB Partially correct
7 Partially correct 43 ms 8048 KB Partially correct
8 Partially correct 40 ms 7804 KB Partially correct
9 Partially correct 39 ms 7876 KB Partially correct
10 Partially correct 39 ms 7884 KB Partially correct
11 Partially correct 39 ms 7780 KB Partially correct
12 Partially correct 40 ms 7888 KB Partially correct
13 Partially correct 43 ms 7808 KB Partially correct
14 Partially correct 44 ms 7932 KB Partially correct
15 Partially correct 41 ms 7808 KB Partially correct
16 Partially correct 43 ms 7884 KB Partially correct
17 Partially correct 45 ms 8172 KB Partially correct
18 Partially correct 47 ms 8120 KB Partially correct
19 Partially correct 46 ms 8268 KB Partially correct
20 Partially correct 38 ms 8348 KB Partially correct
21 Partially correct 40 ms 8188 KB Partially correct
22 Partially correct 44 ms 8444 KB Partially correct
23 Partially correct 38 ms 8352 KB Partially correct
24 Partially correct 43 ms 8256 KB Partially correct
25 Partially correct 45 ms 8456 KB Partially correct
26 Partially correct 47 ms 8296 KB Partially correct
27 Partially correct 44 ms 8424 KB Partially correct
28 Partially correct 47 ms 8272 KB Partially correct
29 Partially correct 44 ms 8384 KB Partially correct
30 Partially correct 44 ms 8376 KB Partially correct
31 Partially correct 44 ms 8364 KB Partially correct
32 Partially correct 41 ms 8688 KB Partially correct
33 Partially correct 40 ms 8220 KB Partially correct