oj.uz

Submission #715217

# Submission time Handle Problem Language Result Execution time Memory
715217 2023-03-26T08:34:12 Z duchuy297 Ancient Machine (JOI21_ancient_machine) C++17
30 / 100
 83 ms 9636 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
namespace {

int variable_example = 0;

}

void Anna(int N, std::vector<char> S) {
	for (auto u : S) {
		if (u == 'X') Send (0), Send (0);
		else if (u == 'Y') Send (0), Send(1);
		else Send (1), Send(0);
	}
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
void Bruno(int N, int L, std::vector<int> A) {
	string s;
	int n = N;
  for (int i=0; i<2*n; i+=2) {
  	if (A[i] == 0 && A[i+1] == 0) s.push_back('X');
  	else if (A[i] == 0 && A[i+1] == 1) s.push_back('Y');
  	else s.push_back('Z');
   }
   int l = -1, r = -1;
   for (int i=0; i<n; i++) {
   	if (s[i] == 'X') {
   		l = i;
   		break;
	   }
   }
   for (int i=n-1; i>=0; i--) {
   	if (s[i] == 'Z') {
   		r = i;
   		break;
	   }
   }
  // cout << s << ' ' << l << ' ' << r << '\n';
   if (l == -1 || r == -1 || l > r) {
   	for (int i=0; i<n; i++) Remove(i);
   	return;
   }
   for (int i=0; i<l; i++) Remove(i);
   for (int i=r+1; i<n; i++) Remove(i);
   stack<int> st;
   st.push(l);
   for (int i=l+1; i<=r; i++) {
   		int u = st.top();
   		if (s[i] == s[u]) {
   			Remove(i);
   			continue;
		   }
		if (s[i] == 'Z') {
			while (st.size() > 1) {
				int u = st.top();
				Remove(u);
				st.pop();
			}
			Remove(i);
		}
		else st.push(i);
   }
   while (st.size()) {
   	int u = st.top();
   	Remove(u);
   	st.pop();
   }
}

Compilation message

Anna.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 1 ms 508 KB Output is correct
2 Correct 0 ms 508 KB Output is correct
3 Correct 0 ms 508 KB Output is correct
4 Correct 1 ms 508 KB Output is correct
5 Correct 1 ms 520 KB Output is correct
6 Correct 1 ms 508 KB Output is correct
7 Correct 1 ms 508 KB Output is correct
8 Correct 1 ms 508 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 2 ms 512 KB Output is correct

Subtask #2
25.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 79 ms 9092 KB Partially correct
2 Partially correct 78 ms 9204 KB Partially correct
3 Partially correct 76 ms 9172 KB Partially correct
4 Partially correct 71 ms 9116 KB Partially correct
5 Partially correct 82 ms 9148 KB Partially correct
6 Partially correct 69 ms 9092 KB Partially correct
7 Partially correct 71 ms 9176 KB Partially correct
8 Partially correct 75 ms 9112 KB Partially correct
9 Partially correct 68 ms 9096 KB Partially correct
10 Partially correct 82 ms 9100 KB Partially correct
11 Partially correct 76 ms 9160 KB Partially correct
12 Partially correct 72 ms 9132 KB Partially correct
13 Partially correct 70 ms 9184 KB Partially correct
14 Partially correct 83 ms 9288 KB Partially correct
15 Partially correct 77 ms 9184 KB Partially correct
16 Partially correct 65 ms 9140 KB Partially correct
17 Partially correct 72 ms 9128 KB Partially correct
18 Partially correct 78 ms 9168 KB Partially correct
19 Partially correct 78 ms 9172 KB Partially correct
20 Partially correct 70 ms 9132 KB Partially correct
21 Partially correct 66 ms 9204 KB Partially correct
22 Partially correct 76 ms 9180 KB Partially correct
23 Partially correct 66 ms 9120 KB Partially correct
24 Partially correct 66 ms 9132 KB Partially correct
25 Partially correct 75 ms 9196 KB Partially correct
26 Partially correct 76 ms 9264 KB Partially correct
27 Partially correct 77 ms 9196 KB Partially correct
28 Partially correct 77 ms 9460 KB Partially correct
29 Partially correct 79 ms 9508 KB Partially correct
30 Partially correct 79 ms 9576 KB Partially correct
31 Partially correct 78 ms 9580 KB Partially correct
32 Partially correct 72 ms 9576 KB Partially correct
33 Partially correct 70 ms 9636 KB Partially correct