# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
684394 | mjhmjh1104 | Ancient Machine (JOI21_ancient_machine) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Bruno.h"
#include <vector>
using namespace std;
bool b[100006];
void Bruno(int n, int l, vector<int> a) {
vector<char> v;
int lt = 0;
while (lt < n && !a[lt]) Remove(lt++);
for (int i = lt + 1; i < n; i++) if (a[i]) {
Remove(i);
b[i] = true;
}
for (int i = lt + 1; i < n; i++) if (!b[i]) Remove(i);
if (lt < n) Remove(lt);
}