oj.uz

Submission #397692

# Submission time Handle Problem Language Result Execution time Memory
397692 2021-05-02T20:36:22 Z MarcoMeijer Cheerleaders (info1cup20_cheerleaders) C++14
100 / 100
 573 ms 11720 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;
const int N = (1<<20);

int n, m, a[MX], ra[MX];
int cnt[MX][20];
ll ways[20][2];

void program() {
    IN(n); m=(1<<n);
    RE(i,m) IN(a[i]);
    RE(i,m) ra[a[i]] = i;

    ll ans = 1e18;
    string ansS, s;
    RE(_,n+1) {
        s.pb('2');
        RE(i,m) ra[i] = (ra[i]>>1)|((ra[i]&1)<<(n-1));
        RE(i,m) RE(j,n) cnt[i][j] = 0;
        RE(j,n) RE(k,2) ways[j][k] = 0;
        
        REV(i,0,m) RE(j,n) {
            int cbm = ra[i]&(~((1<<j)-1));
            if(ra[i]&(1<<j)) ways[j][1] += cnt[cbm^(1<<j)][j];
            else             ways[j][0] += cnt[cbm^(1<<j)][j];
            cnt[cbm][j]++;
        }
        RE(i,m) {
            ll cAns = 0;
            RE(j,n) cAns += ways[j][i&(1<<j) ? 0 : 1];
            if(cAns < ans) {
                ans = cAns;
                ansS = s;
                RE(j,n) {
                    ansS.pb('2');
                    if(i&(1<<j)) ansS.pb('1');
                }
            }
        }
    }
    OUTL(ans);
    OUTL(ansS);
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Correct!
2 Correct 1 ms 332 KB Correct!
3 Correct 1 ms 332 KB Correct!
4 Correct 1 ms 332 KB Correct!

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Correct!
2 Correct 1 ms 332 KB Correct!
3 Correct 1 ms 332 KB Correct!
4 Correct 1 ms 332 KB Correct!

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 464 KB Correct!
2 Correct 3 ms 460 KB Correct!
3 Correct 3 ms 460 KB Correct!
4 Correct 3 ms 460 KB Correct!

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 3148 KB Correct!
2 Correct 64 ms 3276 KB Correct!
3 Correct 145 ms 6352 KB Correct!

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 11608 KB Correct!
2 Correct 383 ms 11608 KB Correct!
3 Correct 573 ms 11588 KB Correct!
4 Correct 568 ms 11720 KB Correct!
5 Correct 555 ms 11604 KB Correct!