# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49352 | Diuven | Unscrambling a Messy Bug (IOI16_messy) | C++11 | 4 ms | 512 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 <bits/stdc++.h>
#include "messy.h"
using namespace std;
const int MX=130;
typedef vector<int> vi;
int n;
void tog(int x, char *s){
s[x]='1'-s[x]+'0';
}
void put(char *s){
add_element(s);
// cout<<"PUT: "<<s<<'\n';
}
bool check(char *s){
bool now=check_element(s);
// cout<<"CHECK: "<<s<<": "<<now<<'\n';
return now;
}
void init(int s, int e){
if(s==e) return;
char X[MX]; X[n]=0;
int m=(s+e)/2;
for(int i=0; i<n; i++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |