#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, have;
int done = 0;
for(int i = 0; i < n; i++){
int cnt = a[2 * i] + a[2 * i + 1];
have.pb(cnt);
if(cnt == 0){
done++;
av.pb(i);
}
if(cnt == 1){
av.pb(i);
}
if(cnt == 2){
while(done > 1){
Remove(av.back());
done -= (1 ^ have[av.back()]);
av.pop_back();
}
Remove(i);
}
}
while(av.size()){
Remove(av.back());
av.pop_back();
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
524 KB |
Wrong Answer [6] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
53 ms |
9788 KB |
Wrong Answer [6] |
2 |
Halted |
0 ms |
0 KB |
- |