oj.uz

Submission #439593

# Submission time Handle Problem Language Result Execution time Memory
439593 2021-06-30T10:17:08 Z LucaIlie Rack (eJOI19_rack) C
40 / 100
 1 ms 320 KB 
#include <stdio.h>

#define MAX_N 1000000
#define MAX_LG 63
#define MOD 1000000007

long long p2[MAX_LG];

int main() {
    int n, r, i;
    long long k;

    scanf( "%d%lld", &n, &k );
    k--;

    p2[0] = 1;
    for ( i = 1; i <= MAX_LG; i++ )
        p2[i] = p2[i - 1] * 2;

    r = 0;
    for ( i = MAX_LG; i >= 0; i-- ) {
        if ( (k / p2[i]) % 2 == 1 )
            r = (p2[n - 1 - i] + r) % MOD;
    }

    printf( "%d", r + 1 );

    return 0;
}

Compilation message

rack.c: In function 'main':
rack.c:13:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf( "%d%lld", &n, &k );
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~
rack.c:18:15: warning: iteration 62 invokes undefined behavior [-Waggressive-loop-optimizations]
   18 |         p2[i] = p2[i - 1] * 2;
      |         ~~~~~~^~~~~~~~~~~~~~~
rack.c:17:5: note: within this loop
   17 |     for ( i = 1; i <= MAX_LG; i++ )
      |     ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 272 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 272 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Incorrect 0 ms 204 KB Output isn't correct
13 Halted 0 ms 0 KB -