Submission #496209

#TimeUsernameProblemLanguageResultExecution timeMemory
496209minhcoolAncient Machine (JOI21_ancient_machine)C++17
0 / 100
51 ms8116 KiB
#include "Anna.h" #include<bits/stdc++.h> using namespace std; //#define int long long #define fi first #define se second #define pb push_back #define mp make_pair #define foru(i, l, r) for(int i = l; i <= r; i++) #define ford(i, r, l) for(int i = r; i >= l; i--) typedef pair<int, int> ii; typedef pair<ii, int> iii; typedef pair<ii, ii> iiii; //const int oo = 1e18 + 7, mod = 1e9 + 7; int ret[100005]; void Anna(int n, vector<char> S){ int need = 0, occ = 0; for(int i = n - 1; i >= 0; i--){ if(S[i] == 'Z'){ occ = 1; ret[i] = 1; } else if(S[i] == 'X' && occ && (!i || S[i - 1] != 'X')){ ret[i] = 1; } } for(int i = 0; i < n; i++) Send(ret[i]); } /* void process(){ } signed main(){ ios_base::sync_with_stdio(0); process(); }*/
#include<bits/stdc++.h> #include "Bruno.h" using namespace std; //#define int long long #define fi first #define se second #define pb push_back #define mp make_pair #define foru(i, l, r) for(int i = l; i <= r; i++) #define ford(i, r, l) for(int i = r; i >= l; i--) typedef pair<int, int> ii; typedef pair<ii, int> iii; typedef pair<ii, ii> iiii; //const int N = 1e5 + 5; //const int oo = 1e18 + 7, mod = 1e9 + 7; void Bruno(int N, int L, vector<int> a){ //cout << N << " " << L << "\n"; vector<int> not_rev; int pos = -1; for(int i = N - 1; i >= 0; i--){ if(a[i]){ pos = i; break; } } if(pos == -1){ for(int i = 0; i < N; i++) Remove(i); return; } int lst = pos; for(int i = pos - 1; i >= 0; i--){ if(a[i]){ for(int j = i + 1; j < lst; j++) Remove(j); Remove(i); lst = i; } //Remove(i); } for(int i = pos; i < N; i++) Remove(i); } /* void process(){ } signed main(){ ios_base::sync_with_stdio(0); process(); }*/

Compilation message (stderr)

Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:22:6: warning: unused variable 'need' [-Wunused-variable]
   22 |  int need = 0, occ = 0;
      |      ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...