oj.uz

답안 #950759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950759 2024-03-20T16:13:21 Z andrei_boaca Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 51 ms 8628 KB 
#include "Anna.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

namespace
{


}

void Anna(int N, std::vector<char> S)
{
    bool havex=0;
    int lastz=-1;
    int zy=0,yx=0;
    for(int i=N-1;i>=0;i--)
        if(S[i]=='Z')
        {
            lastz=i;
            break;
        }
    for(int i=0;i+1<N;i++)
    {
        if(S[i]=='Z'&&S[i+1]=='Y')
            zy++;
        if(S[i]=='Y'&&S[i+1]=='X')
            yx++;
    }
    assert(min(zy,yx)<=N/3);
    for(int i=0;i<N;i++)
    {
        if(S[i]=='X')
        {
            if(!havex)
                Send(1);
            else
                Send(0);
            havex=1;
            continue;
        }
        if(!havex)
        {
            Send(0);
            continue;
        }
        if(S[i]=='Z'&&(i==N||S[i+1]=='Y'||i==lastz))
            Send(1);
        else
            Send(0);
    }
}

#include "Bruno.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

namespace
{


}

void Bruno(int N, int L, std::vector<int> A)
{
    vector<int> vals;
    int lft=-1;
    for(int i=0;i<A.size();i++)
        if(A[i]==1)
        {
            lft=i;
            break;
        }
    if(lft==-1)
    {
        for(int i=0;i<N;i++)
            Remove(i);
        return;
    }
    for(int i=0;i<lft;i++)
        Remove(i);
    for(int i=lft+1;i<A.size();i++)
        if(A[i]==1)
        {
            for(int j=i-1;A[j]==0;j--)
                Remove(j);
            Remove(i);
        }
    for(int i=L-1;A[i]==0;i--)
        Remove(i);
    Remove(lft);
}

Compilation message

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

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 40 ms 7724 KB Partially correct
2 Partially correct 41 ms 8008 KB Partially correct
3 Partially correct 41 ms 8016 KB Partially correct
4 Partially correct 40 ms 7912 KB Partially correct
5 Partially correct 41 ms 7844 KB Partially correct
6 Partially correct 41 ms 7924 KB Partially correct
7 Partially correct 41 ms 7928 KB Partially correct
8 Partially correct 43 ms 8628 KB Partially correct
9 Partially correct 41 ms 7796 KB Partially correct
10 Partially correct 41 ms 7864 KB Partially correct
11 Partially correct 41 ms 7912 KB Partially correct
12 Partially correct 40 ms 7912 KB Partially correct
13 Partially correct 51 ms 7940 KB Partially correct
14 Partially correct 45 ms 7932 KB Partially correct
15 Partially correct 45 ms 7924 KB Partially correct
16 Partially correct 45 ms 7872 KB Partially correct
17 Partially correct 44 ms 7912 KB Partially correct
18 Partially correct 48 ms 7908 KB Partially correct
19 Partially correct 45 ms 8000 KB Partially correct
20 Partially correct 40 ms 7928 KB Partially correct
21 Partially correct 42 ms 7748 KB Partially correct
22 Partially correct 45 ms 7776 KB Partially correct
23 Partially correct 39 ms 7920 KB Partially correct
24 Partially correct 39 ms 7804 KB Partially correct
25 Partially correct 45 ms 7932 KB Partially correct
26 Partially correct 49 ms 7916 KB Partially correct
27 Partially correct 48 ms 7988 KB Partially correct
28 Partially correct 45 ms 7908 KB Partially correct
29 Partially correct 49 ms 8012 KB Partially correct
30 Partially correct 45 ms 8012 KB Partially correct
31 Partially correct 45 ms 7808 KB Partially correct
32 Partially correct 45 ms 8132 KB Partially correct
33 Partially correct 41 ms 8008 KB Partially correct