제출 #725033

#제출 시각아이디문제언어결과실행 시간메모리
725033piOOEAncient Machine (JOI21_ancient_machine)C++17
0 / 100
56 ms7944 KiB
#include "Anna.h" #include <bits/stdc++.h> using namespace std; void Anna(int n, std::vector<char> s) { for (int i = 0; i < n; ++i) { Send(s[i] == 'Y'); } for (int i = 0; i < n; ++i) { Send(s[i] == 'Z'); } }
#include "Bruno.h" #include <bits/stdc++.h> using namespace std; void Bruno(int N, int L, std::vector<int> A) { vector<char> s(N, 'X'); for (int i = 0; i < N; ++i) { if (A[i]) { s[i] = 'Y'; } } for (int i = N; i < 2 * N; ++i) { if (A[i]) { s[i - N] = 'Z'; } } vector<int> stk; int xy = 0; for (int i = 0; i < N; ++i) { if (s[i] == 'Y') { if (!stk.empty() && s[stk.back()] == 'X') { stk.push_back(i); xy += 1; } else { Remove(i); } } else if (s[i] == 'X') { if (!stk.empty() && s[stk.back()] != 'X') { stk.push_back(i); } else { Remove(i); } } else { while (stk.size() > 1) { Remove(stk.back()); stk.pop_back(); } xy = 0; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...