| Task: | Counter |
| Sender: | hundlij1 |
| Submission time: | 2025-11-26 17:38:34 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.00 s | details |
| #10 | ACCEPTED | 0.00 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.00 s | details |
| #15 | ACCEPTED | 0.00 s | details |
| #16 | ACCEPTED | 0.00 s | details |
| #17 | ACCEPTED | 0.00 s | details |
| #18 | ACCEPTED | 0.00 s | details |
| #19 | ACCEPTED | 0.00 s | details |
| #20 | ACCEPTED | 0.00 s | details |
| #21 | ACCEPTED | 0.00 s | details |
| #22 | ACCEPTED | 0.00 s | details |
| #23 | ACCEPTED | 0.00 s | details |
| #24 | ACCEPTED | 0.00 s | details |
| #25 | ACCEPTED | 0.00 s | details |
| #26 | ACCEPTED | 0.01 s | details |
| #27 | ACCEPTED | 0.02 s | details |
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: ACCEPTED
| input |
|---|
| 23 |
| correct output |
|---|
| 8 |
| user output |
|---|
| 8 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 90 |
| correct output |
|---|
| 20 |
| user output |
|---|
| 20 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 8 |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 88 |
| correct output |
|---|
| 8 |
| user output |
|---|
| 8 |
Test 10
Verdict: ACCEPTED
| 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: ACCEPTED
| input |
|---|
| 72 |
| correct output |
|---|
| 16 |
| user output |
|---|
| 16 |
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: ACCEPTED
| input |
|---|
| 81 |
| correct output |
|---|
| 18 |
| user output |
|---|
| 18 |
Test 20
Verdict: ACCEPTED
| input |
|---|
| 19 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 10 |
Test 21
Verdict: ACCEPTED
| input |
|---|
| 21 |
| correct output |
|---|
| 9 |
| user output |
|---|
| 9 |
Test 22
Verdict: ACCEPTED
| input |
|---|
| 249 |
| correct output |
|---|
| 25 |
| user output |
|---|
| 25 |
Test 23
Verdict: ACCEPTED
| input |
|---|
| 835 |
| correct output |
|---|
| 83 |
| user output |
|---|
| 83 |
Test 24
Verdict: ACCEPTED
| input |
|---|
| 94 |
| correct output |
|---|
| 18 |
| user output |
|---|
| 18 |
Test 25
Verdict: ACCEPTED
| input |
|---|
| 10000 |
| correct output |
|---|
| 915 |
| user output |
|---|
| 915 |
Test 26
Verdict: ACCEPTED
| input |
|---|
| 100000 |
| correct output |
|---|
| 9098 |
| user output |
|---|
| 9098 |
Test 27
Verdict: ACCEPTED
| input |
|---|
| 1000000 |
| correct output |
|---|
| 90915 |
| user output |
|---|
| 90915 |
