CSES - Aalto Competitive Programming 2024 - wk12 - Wed - Results
Submission details
Task:Counter
Sender:AleksandrPolitov
Submission time:2024-11-27 17:39:37 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#30.00 sdetails
#40.00 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#9ACCEPTED0.00 sdetails
#100.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#150.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#22ACCEPTED0.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.01 sdetails
#270.01 sdetails

Code

#ifdef ONPC
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define LSOne(S) ((S) & -(S))
using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }
typedef long double T;
typedef complex<T> pt;
#define X real()
#define Y imag()
template<class T>
istream& operator>> (istream& is, complex<T>& p) {
T value;
is >> value;
p.real(value);
is >> value;
p.imag(value);
return is;
}
typedef long long ll;
typedef long double ld;
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif
template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}
const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;
const int N=1e6+10;
ll dp[N];
ll x;
ll rec(ll w, ll mx=x) {
if(dp[w]!=-1) return dp[w];
if(w+11<=mx) {
dp[w]=1+rec(w+11);
}else if(w-2>=0) {
chmin(dp[w], 1+rec(w-2));
}
return dp[w];
}
int solve() {
std::cin >> x;
for (int i = 0; i <= x; i++) {
dp[i]=INF;
}
dp[0]=0;
for (int i = 0; i <= x; i++) {
if(i-2>=0) chmin(dp[i], dp[i-2]+1);
if(i+11<=x) {
chmin(dp[i+11], dp[i]+1);
}
}
for (int i = x; i >=0; i--) {
if(i-2>=0) chmin(dp[i-2], dp[i]+1);
}
for (int i = 0; i <= x; i++) {
if(i-2>=0) chmin(dp[i], dp[i-2]+1);
if(i+11<=x) {
chmin(dp[i+11], dp[i]+1);
}
}
//for (int i = 0; i <= x; i++) {
//std::cout << (dp[x]!=INF ? dp[i] : -1) << " ";
//}
//std::cout << std::endl;
std::cout << (dp[x]==INF ? -1 : dp[x]) << std::endl;
return 0;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int TET = 1;
//cin >> TET;
for (int i = 1; i <= TET; i++) {
#ifdef ONPC
cout << "TEST CASE#" << i << endl;
#endif
if (solve()) {
break;
}
#ifdef ONPC
cout << "__________________________" << endl;
#endif
}
#ifdef ONPC
cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}

Test details

Test 1

Verdict: ACCEPTED

input
0

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
1

correct output
-1

user output
-1

Test 3

Verdict:

input
2

correct output
-1

user output
1

Test 4

Verdict:

input
10

correct output
-1

user output
5

Test 5

Verdict: ACCEPTED

input
11

correct output
1

user output
1

Test 6

Verdict:

input
23

correct output
8

user output
7

Test 7

Verdict:

input
90

correct output
20

user output
9

Test 8

Verdict:

input
8

correct output
-1

user output
4

Test 9

Verdict: ACCEPTED

input
88

correct output
8

user output
8

Test 10

Verdict:

input
2

correct output
-1

user output
1

Test 11

Verdict: ACCEPTED

input
62

correct output
8

user output
8

Test 12

Verdict: ACCEPTED

input
53

correct output
6

user output
6

Test 13

Verdict: ACCEPTED

input
55

correct output
5

user output
5

Test 14

Verdict: ACCEPTED

input
84

correct output
10

user output
10

Test 15

Verdict:

input
72

correct output
16

user output
9

Test 16

Verdict: ACCEPTED

input
71

correct output
10

user output
10

Test 17

Verdict: ACCEPTED

input
16

correct output
5

user output
5

Test 18

Verdict: ACCEPTED

input
86

correct output
9

user output
9

Test 19

Verdict:

input
81

correct output
18

user output
9

Test 20

Verdict:

input
19

correct output
10

user output
5

Test 21

Verdict:

input
21

correct output
9

user output
6

Test 22

Verdict: ACCEPTED

input
249

correct output
25

user output
25

Test 23

Verdict:

input
835

correct output
83

user output
80

Test 24

Verdict:

input
94

correct output
18

user output
11

Test 25

Verdict:

input
10000

correct output
915

user output
914

Test 26

Verdict:

input
100000

correct output
9098

user output
9095

Test 27

Verdict:

input
1000000

correct output
90915

user output
90914