# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
339451 | Vladikus004 | Beautiful row (IZhO12_beauty) | C++14 | 89 ms | 164588 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>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma target("tune=native")
#pragma GCC target("avx2")
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define inf 2e9
#define ff first
#define ss second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int N = 20;
vector <short int> v[N];
short int n;
int a[N];
short int c1[N], c2[N];
void get_cnt(int x, int ind){
int _c1 = 0, _c2 = 0;
int X = x;
while (x){
if (x % 2 == 1) _c1++;
x>>=1;
}
x = X;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |