oj.uz

답안 #853000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
853000 2023-09-23T10:10:17 Z danikoynov Ancient Machine (JOI21_ancient_machine) C++17
69 / 100
 59 ms 8140 KB 
#include "Anna.h"
#include <vector>
#include <bits/stdc++.h>


namespace
{



}

void Anna(int N, std::vector<char> S)
{
    for (int i = 0; i < N; i ++)
    {
        if (S[i] == '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

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 792 KB Output is correct
2 Correct 0 ms 776 KB Output is correct
3 Correct 0 ms 776 KB Output is correct
4 Correct 0 ms 780 KB Output is correct
5 Correct 0 ms 776 KB Output is correct
6 Correct 0 ms 792 KB Output is correct
7 Correct 0 ms 780 KB Output is correct
8 Correct 0 ms 788 KB Output is correct
9 Correct 1 ms 776 KB Output is correct
10 Correct 1 ms 792 KB Output is correct
11 Correct 0 ms 780 KB Output is correct

Subtask #2
64.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 40 ms 7880 KB Partially correct
2 Partially correct 39 ms 7968 KB Partially correct
3 Partially correct 43 ms 7884 KB Partially correct
4 Partially correct 39 ms 7764 KB Partially correct
5 Partially correct 40 ms 8140 KB Partially correct
6 Partially correct 40 ms 7752 KB Partially correct
7 Partially correct 40 ms 7908 KB Partially correct
8 Partially correct 39 ms 7804 KB Partially correct
9 Partially correct 39 ms 7900 KB Partially correct
10 Partially correct 40 ms 7820 KB Partially correct
11 Partially correct 39 ms 7880 KB Partially correct
12 Partially correct 45 ms 7864 KB Partially correct
13 Partially correct 48 ms 7840 KB Partially correct
14 Partially correct 46 ms 7768 KB Partially correct
15 Partially correct 46 ms 7864 KB Partially correct
16 Partially correct 46 ms 7884 KB Partially correct
17 Partially correct 44 ms 7916 KB Partially correct
18 Partially correct 44 ms 7928 KB Partially correct
19 Partially correct 45 ms 8024 KB Partially correct
20 Partially correct 40 ms 7824 KB Partially correct
21 Partially correct 42 ms 7820 KB Partially correct
22 Partially correct 44 ms 7948 KB Partially correct
23 Partially correct 39 ms 7824 KB Partially correct
24 Partially correct 39 ms 7812 KB Partially correct
25 Partially correct 44 ms 7808 KB Partially correct
26 Partially correct 44 ms 7904 KB Partially correct
27 Partially correct 47 ms 7812 KB Partially correct
28 Partially correct 45 ms 7924 KB Partially correct
29 Partially correct 44 ms 7916 KB Partially correct
30 Partially correct 47 ms 7776 KB Partially correct
31 Partially correct 44 ms 7748 KB Partially correct
32 Partially correct 43 ms 7808 KB Partially correct
33 Partially correct 59 ms 7812 KB Partially correct