oj.uz

Submission #892950

# Submission time Handle Problem Language Result Execution time Memory
892950 2023-12-26T08:41:40 Z marvinthang Broken Device 2 (JOI22_device2) C++17
10 / 100
 2000 ms 32776 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 len = 1;
	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;
	}
	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 = u.size() / 2;
	return len * len + count(ALL(u), 1);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 13 ms 1124 KB Output is correct
3 Correct 18 ms 1464 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 13 ms 1124 KB Output is correct
3 Correct 18 ms 1464 KB Output is correct
4 Correct 441 ms 21952 KB Output is correct
5 Correct 418 ms 21996 KB Output is correct
6 Correct 427 ms 22236 KB Output is correct
7 Correct 460 ms 21684 KB Output is correct
8 Correct 424 ms 22192 KB Output is correct
9 Correct 625 ms 32776 KB Output is correct
10 Correct 616 ms 32452 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 13 ms 1124 KB Output is correct
3 Correct 18 ms 1464 KB Output is correct
4 Correct 441 ms 21952 KB Output is correct
5 Correct 418 ms 21996 KB Output is correct
6 Correct 427 ms 22236 KB Output is correct
7 Correct 460 ms 21684 KB Output is correct
8 Correct 424 ms 22192 KB Output is correct
9 Correct 625 ms 32776 KB Output is correct
10 Correct 616 ms 32452 KB Output is correct
11 Incorrect 0 ms 1044 KB Wrong Answer [3]
12 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 13 ms 1124 KB Output is correct
3 Correct 18 ms 1464 KB Output is correct
4 Correct 441 ms 21952 KB Output is correct
5 Correct 418 ms 21996 KB Output is correct
6 Correct 427 ms 22236 KB Output is correct
7 Correct 460 ms 21684 KB Output is correct
8 Correct 424 ms 22192 KB Output is correct
9 Correct 625 ms 32776 KB Output is correct
10 Correct 616 ms 32452 KB Output is correct
11 Incorrect 0 ms 1044 KB Wrong Answer [3]
12 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 13 ms 1124 KB Output is correct
3 Correct 18 ms 1464 KB Output is correct
4 Correct 441 ms 21952 KB Output is correct
5 Correct 418 ms 21996 KB Output is correct
6 Correct 427 ms 22236 KB Output is correct
7 Correct 460 ms 21684 KB Output is correct
8 Correct 424 ms 22192 KB Output is correct
9 Correct 625 ms 32776 KB Output is correct
10 Correct 616 ms 32452 KB Output is correct
11 Incorrect 0 ms 1044 KB Wrong Answer [3]
12 Halted 0 ms 0 KB -

Subtask #6
0 / 60.0

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