oj.uz

Submission #1010909

# Submission time Handle Problem Language Result Execution time Memory
1010909 2024-06-29T14:07:08 Z Unforgettablepl Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 50 ms 8356 KB 
#include "Anna.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

namespace {
}

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

#include "Bruno.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

namespace {
}  // namespace

void Bruno(int N, int L, std::vector<int> A) {
    vector<bool> vis(N);
    vector<int> po;
    for(int i=0;i<N;i++){
        if(A[i]==1)po.emplace_back(i);
    }
    for(int x=1;x<po.size();x++){
        for(int i=po[x]-1;i>po[x-1];i--){
            Remove(i);
            vis[i]=true;
        }
        vis[po[x]]=true;
        Remove(po[x]);
    }
    for(int i=0;i<N;i++)if(!vis[i])Remove(i);
}

Compilation message

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

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

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 34 ms 8232 KB Partially correct
2 Partially correct 33 ms 8248 KB Partially correct
3 Partially correct 33 ms 8252 KB Partially correct
4 Partially correct 33 ms 8268 KB Partially correct
5 Partially correct 34 ms 8224 KB Partially correct
6 Partially correct 36 ms 8196 KB Partially correct
7 Partially correct 37 ms 8260 KB Partially correct
8 Partially correct 33 ms 8304 KB Partially correct
9 Partially correct 32 ms 8284 KB Partially correct
10 Partially correct 42 ms 8252 KB Partially correct
11 Partially correct 34 ms 8208 KB Partially correct
12 Partially correct 31 ms 8296 KB Partially correct
13 Partially correct 39 ms 8348 KB Partially correct
14 Partially correct 41 ms 8204 KB Partially correct
15 Partially correct 34 ms 8212 KB Partially correct
16 Partially correct 34 ms 8208 KB Partially correct
17 Partially correct 40 ms 8276 KB Partially correct
18 Partially correct 50 ms 8116 KB Partially correct
19 Partially correct 40 ms 8272 KB Partially correct
20 Partially correct 33 ms 8256 KB Partially correct
21 Partially correct 33 ms 8260 KB Partially correct
22 Partially correct 39 ms 8232 KB Partially correct
23 Partially correct 28 ms 8252 KB Partially correct
24 Partially correct 34 ms 8116 KB Partially correct
25 Partially correct 40 ms 8328 KB Partially correct
26 Partially correct 40 ms 8280 KB Partially correct
27 Partially correct 42 ms 8248 KB Partially correct
28 Partially correct 40 ms 8240 KB Partially correct
29 Partially correct 41 ms 8252 KB Partially correct
30 Partially correct 40 ms 8320 KB Partially correct
31 Partially correct 42 ms 8356 KB Partially correct
32 Partially correct 32 ms 8228 KB Partially correct
33 Partially correct 36 ms 8284 KB Partially correct