oj.uz

Submission #568274

# Submission time Handle Problem Language Result Execution time Memory
568274 2022-05-25T04:48:03 Z maomao90 Broken Device 2 (JOI22_device2) C++17
5 / 100
 409 ms 18092 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Anna.h"
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

namespace {
    const int LEN = 100;
    ll a;
    vi s, t;
}

int Declare() {
    return 2000;
}

pair<vi, vi> Anna(ll A) {
    s.clear(); t.clear();
    a = A;
    int lg = 63 - __builtin_clzll(a);
    cerr << a << ' ' << lg << '\n';
    REP (i, 0, lg + 1) {
        REP (z, 0, LEN) {
            s.pb((a >> i & 1) && (z == LEN - 1));
            t.pb(0);
        }
    }
    cerr << bitset<7>(a) << '\n';
    for (int i : s) {
        cerr << i;
    }
    cerr << '\n';
    for (int i : t) {
        cerr << i;
    }
    cerr << '\n';
    return {s, t};
}

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
#include "Bruno.h"
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

namespace {
    const int LEN = 100;
}

ll Bruno(vi u) {
    for (int i : u) {
        cerr << i;
    }
    cerr << '\n';
    int lg = SZ(u) / 2 / LEN - 1;
    int fi = -1, se = -1;
    int cnt = 0;
    vii vec;
    REP (i, 0, SZ(u)) {
        if (u[i] == 1) {
            cnt++;
            if (cnt == 1) {
                fi = i;
            }
            if (cnt == 1) {
                se = i;
                vec.pb({fi, se});
                cnt = 0;
            }
        }
    }
    int p = 0;
    int k = 0;
    ll ans = 0;
    REP (i, 0, SZ(vec)) {
        int cnt = 0;
        REP (j, 0, vec[i].SE) {
            cnt += u[j] == 0;
        }
        cerr << cnt << '\n';
        int zeros = round((ld) cnt / 2 / LEN);
        k = zeros - 1;
        ans |= 1ll << k;
        k++;
        p = vec[i].SE + 1;
    }
    cerr << bitset<7>(ans) << '\n';
    cerr << ans << '\n';
    return ans; 
}

Compilation message

Bruno.cpp: In function 'll Bruno(vi)':
Bruno.cpp:44:9: warning: unused variable 'lg' [-Wunused-variable]
   44 |     int lg = SZ(u) / 2 / LEN - 1;
      |         ^~
Bruno.cpp:61:9: warning: variable 'p' set but not used [-Wunused-but-set-variable]
   61 |     int p = 0;
      |         ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 648 KB Output is correct
2 Correct 324 ms 15128 KB Output is correct
3 Correct 409 ms 18092 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 648 KB Output is correct
2 Correct 324 ms 15128 KB Output is correct
3 Correct 409 ms 18092 KB Output is correct
4 Incorrect 3 ms 652 KB Wrong Answer [3]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 648 KB Output is correct
2 Correct 324 ms 15128 KB Output is correct
3 Correct 409 ms 18092 KB Output is correct
4 Incorrect 3 ms 652 KB Wrong Answer [3]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 648 KB Output is correct
2 Correct 324 ms 15128 KB Output is correct
3 Correct 409 ms 18092 KB Output is correct
4 Incorrect 3 ms 652 KB Wrong Answer [3]
5 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 648 KB Output is correct
2 Correct 324 ms 15128 KB Output is correct
3 Correct 409 ms 18092 KB Output is correct
4 Incorrect 3 ms 652 KB Wrong Answer [3]
5 Halted 0 ms 0 KB -

Subtask #6
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 772 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -