Submission details
Task:Counter
Sender:hundlij1
Submission time:2025-11-26 17:34:13 +0200
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails
#70.00 sdetails
#8ACCEPTED0.00 sdetails
#90.00 sdetails
#10ACCEPTED0.00 sdetails
#110.00 sdetails
#120.00 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails
#160.00 sdetails
#170.00 sdetails
#180.00 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.01 sdetails

Code

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <climits>
#include <map>
using namespace std;
typedef long long ll;

void task7() {

   ll x;
    cin >> x;
    
    vector<ll> dist(x + 1, -1);
    queue<ll> q;
    
    q.push(0);
    dist[0] = 0;
    
    while(!q.empty()){
        ll curr = q.front();
        q.pop();
        
        if(curr == x){
            cout << dist[x] << endl;
            return;
        }
        
        if(curr + 11 == x && dist[curr + 11] == -1){
            dist[curr + 11] = dist[curr] + 1;
            q.push(curr + 11);
        }
        
        if(curr - 2 >= 0 && dist[curr - 2] == -1){
            dist[curr - 2] = dist[curr] + 1;
            q.push(curr - 2);
        }
    }
    
    cout << -1 << endl;

}

void task3(){
    ll n;
    cin >> n;
    
    const ll MOD = 1000000007;
    vector<ll> dp(n + 1, 0);
    dp[0] = 1;
    
    for(ll i = 1; i <= n; i++){
        for(ll j = 1; j <= 6; j++){
            if(i - j >= 0){
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }
    }
    
    cout << dp[n] << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    task7();

}

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: ACCEPTED

input
2

correct output
-1

user output
-1

Test 4

Verdict: ACCEPTED

input
10

correct output
-1

user output
-1

Test 5

Verdict: ACCEPTED

input
11

correct output
1

user output
1

Test 6

Verdict:

input
23

correct output
8

user output
-1

Test 7

Verdict:

input
90

correct output
20

user output
-1

Test 8

Verdict: ACCEPTED

input
8

correct output
-1

user output
-1

Test 9

Verdict:

input
88

correct output
8

user output
-1

Test 10

Verdict: ACCEPTED

input
2

correct output
-1

user output
-1

Test 11

Verdict:

input
62

correct output
8

user output
-1

Test 12

Verdict:

input
53

correct output
6

user output
-1

Test 13

Verdict:

input
55

correct output
5

user output
-1

Test 14

Verdict:

input
84

correct output
10

user output
-1

Test 15

Verdict:

input
72

correct output
16

user output
-1

Test 16

Verdict:

input
71

correct output
10

user output
-1

Test 17

Verdict:

input
16

correct output
5

user output
-1

Test 18

Verdict:

input
86

correct output
9

user output
-1

Test 19

Verdict:

input
81

correct output
18

user output
-1

Test 20

Verdict:

input
19

correct output
10

user output
-1

Test 21

Verdict:

input
21

correct output
9

user output
-1

Test 22

Verdict:

input
249

correct output
25

user output
-1

Test 23

Verdict:

input
835

correct output
83

user output
-1

Test 24

Verdict:

input
94

correct output
18

user output
-1

Test 25

Verdict:

input
10000

correct output
915

user output
-1

Test 26

Verdict:

input
100000

correct output
9098

user output
-1

Test 27

Verdict:

input
1000000

correct output
90915

user output
-1