# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095365 | idiotcomputer | Unscrambling a Messy Bug (IOI16_messy) | C++11 | 1 ms | 604 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 "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
void cl(string &t){
for (int i = 0; i < sz(t); i++) t[i] = '0';
}
bool chin(vector<int> &a, int v){
for (int c : a) if (c == v) return 1;
return 0;
}
vector<int> restore_permutation(int n, int w, int r){
int k = 0;
int c = 1;
while (c < n){
c *= 2;
k++;
}
k = max(3,k);
string t = "";
for (int i = 0; i < n; i++) t += '0';
for (int i = 0; i < k; i++){
cl(t);
# | 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... |