oj.uz

Submission #928558

# Submission time Handle Problem Language Result Execution time Memory
928558 2024-02-16T16:17:35 Z denniskim Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 53 ms 8632 KB 
#include "Anna.h"
#include <vector>

namespace {
int X = -1;
}

void Anna(int N, std::vector<char> S)
{
	X = -1;
	
	for(int i = 0 ; i < N ; i++)
	{
		int ff = 0;
		
		if(S[i] == 'X')
		{
			if(X == -1)
				ff = 1, X = i;
		}
		
		else if(S[i] == 'Z')
		{
			if(X != -1)
			{
				if(i == N - 1 || S[i + 1] != 'Z')
					ff = 1;
			}
		}
		
		Send(ff);
	}
}
#include "Bruno.h"
#include <vector>

namespace {

int variable_example = 0;

int FunctionExample(int P) { return 1 - P; }

}  // namespace

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

Compilation message

Bruno.cpp:8:5: warning: 'int {anonymous}::FunctionExample(int)' defined but not used [-Wunused-function]
    8 | int FunctionExample(int P) { return 1 - P; }
      |     ^~~~~~~~~~~~~~~
Bruno.cpp:6:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    6 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 48 ms 7840 KB Partially correct
2 Partially correct 40 ms 7796 KB Partially correct
3 Partially correct 40 ms 8208 KB Partially correct
4 Partially correct 43 ms 8356 KB Partially correct
5 Partially correct 40 ms 8272 KB Partially correct
6 Partially correct 39 ms 8280 KB Partially correct
7 Partially correct 45 ms 8324 KB Partially correct
8 Partially correct 40 ms 8312 KB Partially correct
9 Partially correct 40 ms 8272 KB Partially correct
10 Partially correct 39 ms 8300 KB Partially correct
11 Partially correct 38 ms 8448 KB Partially correct
12 Partially correct 39 ms 8404 KB Partially correct
13 Partially correct 45 ms 8360 KB Partially correct
14 Partially correct 46 ms 8340 KB Partially correct
15 Partially correct 41 ms 8304 KB Partially correct
16 Partially correct 41 ms 8340 KB Partially correct
17 Partially correct 53 ms 8376 KB Partially correct
18 Partially correct 49 ms 8632 KB Partially correct
19 Partially correct 46 ms 8164 KB Partially correct
20 Partially correct 38 ms 8236 KB Partially correct
21 Partially correct 38 ms 8380 KB Partially correct
22 Partially correct 44 ms 8328 KB Partially correct
23 Partially correct 43 ms 8336 KB Partially correct
24 Partially correct 39 ms 8288 KB Partially correct
25 Partially correct 44 ms 8344 KB Partially correct
26 Partially correct 44 ms 8448 KB Partially correct
27 Partially correct 46 ms 8452 KB Partially correct
28 Partially correct 45 ms 8464 KB Partially correct
29 Partially correct 44 ms 8384 KB Partially correct
30 Partially correct 47 ms 8368 KB Partially correct
31 Partially correct 45 ms 8200 KB Partially correct
32 Partially correct 39 ms 8388 KB Partially correct
33 Partially correct 38 ms 8348 KB Partially correct