oj.uz

답안 #798403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
798403 2023-07-30T16:42:23 Z Sohsoh84 Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 55 ms 8656 KB 
#include "Anna.h"
#include <bits/stdc++.h>

using namespace std;

namespace {
	int variable_example = 0;
}

void Anna(int N, std::vector<char> S) {
	variable_example++;
	bool flag = true;
	vector<int> ans;
	for (int i = 0; i < N; i++) {
		if (S[i] == 'X') flag = false;
		ans.push_back(flag || S[i] == 'Z');
	}

	while (!ans.empty() && ans.back() != 1) ans.pop_back();
	if (!ans.empty()) ans.pop_back();

	for (int e : ans)
		Send(e);
}

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

using namespace std;

namespace {

	int variable_example = 0;

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

}  // namespace

void Bruno(int N, int L, std::vector<int> A) {
	A.push_back(1);
	while (A.size() < N) A.push_back(0);

	stack<int> st;
	for (int i = 0; i < N; i++) {
		if (A[i]) {
			while (st.size() > 1) {
				Remove(st.top());
				st.pop();
			}

			Remove(i);
		} else st.push(i);
	}

	while (!st.empty()) {
		Remove(st.top());
		st.pop();
	}
}

Compilation message

Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:16:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |  while (A.size() < N) A.push_back(0);
      |         ~~~~~~~~~^~~
Bruno.cpp: At global scope:
Bruno.cpp:10:6: warning: 'int {anonymous}::FunctionExample(int)' defined but not used [-Wunused-function]
   10 |  int FunctionExample(int P) { return 1 - P; }
      |      ^~~~~~~~~~~~~~~
Bruno.cpp:8:6: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    8 |  int variable_example = 0;
      |      ^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 508 KB Output is correct
2 Correct 0 ms 520 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 0 ms 524 KB Output is correct
7 Correct 0 ms 512 KB Output is correct
8 Correct 0 ms 520 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 1 ms 504 KB Output is correct
11 Correct 1 ms 520 KB Output is correct

Subtask #2
65.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 48 ms 8408 KB Partially correct
2 Partially correct 41 ms 8448 KB Partially correct
3 Partially correct 44 ms 8468 KB Partially correct
4 Partially correct 49 ms 8516 KB Partially correct
5 Partially correct 41 ms 8560 KB Partially correct
6 Partially correct 44 ms 8488 KB Partially correct
7 Partially correct 43 ms 8508 KB Partially correct
8 Partially correct 44 ms 8528 KB Partially correct
9 Partially correct 40 ms 8420 KB Partially correct
10 Partially correct 40 ms 8596 KB Partially correct
11 Partially correct 41 ms 8560 KB Partially correct
12 Partially correct 51 ms 8528 KB Partially correct
13 Partially correct 40 ms 8608 KB Partially correct
14 Partially correct 50 ms 8568 KB Partially correct
15 Partially correct 43 ms 8560 KB Partially correct
16 Partially correct 43 ms 8604 KB Partially correct
17 Correct 28 ms 7404 KB Output is correct
18 Partially correct 50 ms 8476 KB Partially correct
19 Partially correct 50 ms 8416 KB Partially correct
20 Partially correct 41 ms 8548 KB Partially correct
21 Partially correct 41 ms 8588 KB Partially correct
22 Partially correct 40 ms 8620 KB Partially correct
23 Partially correct 40 ms 8620 KB Partially correct
24 Partially correct 46 ms 8656 KB Partially correct
25 Partially correct 45 ms 8600 KB Partially correct
26 Correct 28 ms 7428 KB Output is correct
27 Partially correct 46 ms 8556 KB Partially correct
28 Correct 28 ms 7396 KB Output is correct
29 Partially correct 48 ms 8532 KB Partially correct
30 Partially correct 49 ms 8504 KB Partially correct
31 Partially correct 55 ms 8468 KB Partially correct
32 Partially correct 41 ms 8464 KB Partially correct
33 Partially correct 41 ms 8612 KB Partially correct