Submission details
Task:Broken Clock
Sender:hundlij1
Submission time:2025-11-26 17:48:51 +0200
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#90.00 sdetails
#100.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.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 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 task4(){

    double x;
    cin >> x;
    
    if(x == 1.0){
        cout << -1 << endl;
    } else {
        double diff = abs(2.0 * x - 2.0);
        ll result = (ll)floor(diff);
        cout << result << endl;
    }

}

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);

    task4();

}

Test details

Test 1

Verdict:

input
0.9971848082

correct output
1

user output
0

Test 2

Verdict:

input
0.1850820816

correct output
2

user output
1

Test 3

Verdict:

input
0.0707248805

correct output
2

user output
1

Test 4

Verdict:

input
0.9006214549

correct output
1

user output
0

Test 5

Verdict:

input
0.1103602416

correct output
2

user output
1

Test 6

Verdict:

input
1.8949521528

correct output
2

user output
1

Test 7

Verdict:

input
0.4546781499

correct output
2

user output
1

Test 8

Verdict:

input
0.0222288765

correct output
2

user output
1

Test 9

Verdict:

input
0.7289220523

correct output
1

user output
0

Test 10

Verdict:

input
0.3415342411

correct output
2

user output
1

Test 11

Verdict:

input
3.5098148931

correct output
6

user output
5

Test 12

Verdict:

input
4.1380954486

correct output
7

user output
6

Test 13

Verdict:

input
2.5952502394

correct output
4

user output
3

Test 14

Verdict:

input
4.8654862770

correct output
8

user output
7

Test 15

Verdict:

input
1.3678163674

correct output
1

user output
0

Test 16

Verdict:

input
0.2589275239

correct output
2

user output
1

Test 17

Verdict:

input
4.8654294622

correct output
8

user output
7

Test 18

Verdict:

input
6.5028570446

correct output
12

user output
11

Test 19

Verdict:

input
1.2075778391

correct output
1

user output
0

Test 20

Verdict:

input
2.1243024932

correct output
3

user output
2

Test 21

Verdict:

input
3.4317726189

correct output
5

user output
4

Test 22

Verdict:

input
7.5915124659

correct output
14

user output
13

Test 23

Verdict:

input
3.0255238309

correct output
5

user output
4

Test 24

Verdict:

input
1.0261771146

correct output
1

user output
0

Test 25

Verdict:

input
6.4644975568

correct output
11

user output
10

Test 26

Verdict:

input
6.2380263835

correct output
11

user output
10

Test 27

Verdict:

input
1.5098866001

correct output
2

user output
1

Test 28

Verdict:

input
43.0019451095

correct output
85

user output
84

Test 29

Verdict:

input
91.2845645502

correct output
181

user output
180

Test 30

Verdict:

input
41.9205573795

correct output
82

user output
81

Test 31

Verdict:

input
40.0930977879

correct output
79

user output
78

Test 32

Verdict:

input
16.8983402792

correct output
32

user output
31

Test 33

Verdict:

input
95.8596173978

correct output
190

user output
189

Test 34

Verdict:

input
21.3799957375

correct output
41

user output
40

Test 35

Verdict:

input
83.9752180260

correct output
166

user output
165

Test 36

Verdict:

input
80.6444465607

correct output
160

user output
159