Submission #940067

#TimeUsernameProblemLanguageResultExecution timeMemory
940067lamterAncient Machine (JOI21_ancient_machine)C++17
5 / 100
40 ms8180 KiB
#include "Anna.h" #include <bits/stdc++.h> void Anna(int n, std::vector <char> a) { bool found = 0; std::vector <int> b(n); for (int i = 0; i < n; i += 1) { int bit = 0; if (not found and a[i] == 'X') { bit = 1; found = true; } if (found and a[i] == 'Z' and (i + 1 == n or a[i + 1] != 'Z') and (b[i - 1] != 1)) { bit = 1; } b[i] = bit; Send(bit); } }
#include "Bruno.h" #include <bits/stdc++.h> void Bruno(int n, int l, std::vector <int> a) { std::vector <int> posOne; for (int i = 0; i < n; i += 1) if (a[i]) posOne.push_back(i); if (posOne.size() < 2) { for (int i = 0; i < n; i += 1) Remove(i); return; } int x = posOne[0]; for (int i = 0; i < x; i += 1) { Remove(i); } for (int i = 0; i + 1 < (int) posOne.size(); i += 1) { for (int j = posOne[i + 1] - 1; j > posOne[i]; j -= 1) Remove(j); Remove(posOne[i + 1]); } for (int j = posOne.back() + 1; j < n; j += 1) { Remove(j); } Remove(x); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...