oj.uz

Submission #892955

# Submission time Handle Problem Language Result Execution time Memory
892955 2023-12-26T08:50:50 Z marvinthang Broken Device 2 (JOI22_device2) C++17
13 / 100
 2000 ms 26064 KB 
/*************************************
*    author: marvinthang             *
*    created: 26.12.2023 15:37:58    *
*************************************/

#include "Anna.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

namespace {

}

int Declare() {
	return 2000;
}

pair <vector <int>, vector <int>> Anna(long long A) {
	int b0 = BIT(A, 0);
	int b1 = BIT(A, 1);
	A /= 4;
	int len = 0;
	while (len * len + len + len < A) ++len;
	vector <int> sa(len), sb(len);
	A -= len * len;
	if (A <= len) REP(i, A) sa[i] = 1;
	else {
		REP(i, len) sa[i] = 1;
		REP(i, A - len) sb[i] = 1;
	}
	sa.insert(sa.begin(), b0);
	sb.insert(sb.begin(), b0);
	sa.push_back(b1);
	sb.push_back(b1);
	return pair{sa, sb};
}

/*************************************
*    author: marvinthang             *
*    created: 26.12.2023 15:40:10    *
*************************************/

#include "Bruno.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

namespace {

}

long long Bruno(vector <int> u) {
	int len = (int) u.size() / 2 - 2;
	int res = len * len + count(ALL(u), 1);
	res -= (u[0] + u.back()) * 2;
	res = res << 1 | u.back();
	res = res << 1 | u[0];
	return res;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 10 ms 1092 KB Output is correct
3 Correct 12 ms 1136 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 10 ms 1092 KB Output is correct
3 Correct 12 ms 1136 KB Output is correct
4 Correct 230 ms 11556 KB Output is correct
5 Correct 228 ms 11640 KB Output is correct
6 Correct 235 ms 12664 KB Output is correct
7 Correct 228 ms 11312 KB Output is correct
8 Correct 235 ms 11828 KB Output is correct
9 Correct 338 ms 16676 KB Output is correct
10 Correct 339 ms 16752 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 10 ms 1092 KB Output is correct
3 Correct 12 ms 1136 KB Output is correct
4 Correct 230 ms 11556 KB Output is correct
5 Correct 228 ms 11640 KB Output is correct
6 Correct 235 ms 12664 KB Output is correct
7 Correct 228 ms 11312 KB Output is correct
8 Correct 235 ms 11828 KB Output is correct
9 Correct 338 ms 16676 KB Output is correct
10 Correct 339 ms 16752 KB Output is correct
11 Correct 368 ms 18076 KB Output is correct
12 Correct 366 ms 18124 KB Output is correct
13 Correct 361 ms 17760 KB Output is correct
14 Correct 362 ms 17880 KB Output is correct
15 Correct 364 ms 17540 KB Output is correct
16 Correct 534 ms 26064 KB Output is correct
17 Correct 528 ms 25788 KB Output is correct
18 Correct 267 ms 13272 KB Output is correct
19 Correct 272 ms 13312 KB Output is correct
20 Correct 266 ms 13232 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 10 ms 1092 KB Output is correct
3 Correct 12 ms 1136 KB Output is correct
4 Correct 230 ms 11556 KB Output is correct
5 Correct 228 ms 11640 KB Output is correct
6 Correct 235 ms 12664 KB Output is correct
7 Correct 228 ms 11312 KB Output is correct
8 Correct 235 ms 11828 KB Output is correct
9 Correct 338 ms 16676 KB Output is correct
10 Correct 339 ms 16752 KB Output is correct
11 Correct 368 ms 18076 KB Output is correct
12 Correct 366 ms 18124 KB Output is correct
13 Correct 361 ms 17760 KB Output is correct
14 Correct 362 ms 17880 KB Output is correct
15 Correct 364 ms 17540 KB Output is correct
16 Correct 534 ms 26064 KB Output is correct
17 Correct 528 ms 25788 KB Output is correct
18 Correct 267 ms 13272 KB Output is correct
19 Correct 272 ms 13312 KB Output is correct
20 Correct 266 ms 13232 KB Output is correct
21 Incorrect 1 ms 796 KB Wrong Answer [3]
22 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 10 ms 1092 KB Output is correct
3 Correct 12 ms 1136 KB Output is correct
4 Correct 230 ms 11556 KB Output is correct
5 Correct 228 ms 11640 KB Output is correct
6 Correct 235 ms 12664 KB Output is correct
7 Correct 228 ms 11312 KB Output is correct
8 Correct 235 ms 11828 KB Output is correct
9 Correct 338 ms 16676 KB Output is correct
10 Correct 339 ms 16752 KB Output is correct
11 Correct 368 ms 18076 KB Output is correct
12 Correct 366 ms 18124 KB Output is correct
13 Correct 361 ms 17760 KB Output is correct
14 Correct 362 ms 17880 KB Output is correct
15 Correct 364 ms 17540 KB Output is correct
16 Correct 534 ms 26064 KB Output is correct
17 Correct 528 ms 25788 KB Output is correct
18 Correct 267 ms 13272 KB Output is correct
19 Correct 272 ms 13312 KB Output is correct
20 Correct 266 ms 13232 KB Output is correct
21 Incorrect 1 ms 796 KB Wrong Answer [3]
22 Halted 0 ms 0 KB -

Subtask #6
0 / 60.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2033 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -