Submission #798380

#TimeUsernameProblemLanguageResultExecution timeMemory
798380fatemetmhrAncient Machine (JOI21_ancient_machine)C++17
0 / 100
53 ms9072 KiB
#include "Anna.h" #include <bits/stdc++.h> //#pragma GCC optimize ("O3") //#pragma GCC target("avx2") //#pragma GCC optimize("unroll-loops,Ofast") using namespace std; typedef long long ll; #define pb push_back #define mp make_pair #define all(x) x.begin(), x.end() #define fi first #define se second void Anna(int n, std::vector<char> s) { for(int i = 0; i < n; i++){ if(s[i] == 'X'){ Send(0); Send(0); } if(s[i] == 'Y'){ Send(1); Send(0); } if(s[i] == 'Z'){ Send(1); Send(1); } } }
// ~ Be Name Khoda ~ // #include "Bruno.h" #include <bits/stdc++.h> //#pragma GCC optimize ("O3") //#pragma GCC target("avx2") //#pragma GCC optimize("unroll-loops,Ofast") using namespace std; typedef long long ll; #define pb push_back #define mp make_pair #define all(x) x.begin(), x.end() #define fi first #define se second void Bruno(int n, int l, std::vector<int> a){ vector <int> av; for(int i = 0; i < n; i++){ int cnt = a[2 * i] + a[2 * i + 1]; if(cnt == 0){ if(av.size() && av.back() == 0) Remove(i); else av.pb(i); } if(cnt == 1){ if(av.empty() || av.back() == 1) Remove(i); else av.pb(i); } if(cnt == 2){ while(av.size()){ Remove(av.back()); av.pop_back(); } Remove(i); } } while(av.size()){ Remove(av.back()); av.pop_back(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...