제출 #798377

#제출 시각아이디문제언어결과실행 시간메모리
798377Sohsoh84Ancient Machine (JOI21_ancient_machine)C++17
30 / 100
67 ms9956 KiB
#include "Anna.h" #include <bits/stdc++.h> using namespace std; namespace { } void Anna(int N, vector<char> S) { for (int i = 0; i < N; i++) { if (S[i] == 'X') Send(0), Send(0); else if (S[i] == 'Y') Send(0), Send(1); else Send(1), Send(0); } }
#include "Bruno.h" #include <bits/stdc++.h> using namespace std; namespace { const int MAXN = 1e6 + 10; vector<int> A; bool B[MAXN]; } inline void remove(int ind) { B[ind] = true; Remove(ind); } void Bruno(int N, int L, vector<int> INP) { for (int i = 0; i < N; i++) { int ax = INP[i << 1], ay = INP[i << 1 | 1]; if (ax == 0 && ay == 0) A.push_back(0); else if (ax == 0) A.push_back(1); else A.push_back(2); } stack<int> st; for (int i = 0; i < N; i++) { if (A[i] != 0 && st.empty()) { remove(i); } else { if (A[i] == 2) { while (int(st.size()) > 1) remove(st.top()), st.pop(); remove(i); } else { st.push(i); } } } for (int i = 0; i < N; i++) if (!B[i]) remove(i); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...