oj.uz

Submission #329292

# Submission time Handle Problem Language Result Execution time Memory
329292 2020-11-20T08:51:15 Z dolphingarlic Circus (Balkan15_CIRCUS) C++14
0 / 100
 23 ms 1900 KB 
#include "circus.h"

#include <algorithm>
#include <iostream>

int n, m, p[100000];

void init(int N, int M, int P[]){
    n = N, m = M;
    for (int i = 0; i < n; i++) p[i] = P[i];
    std::sort(p, p + n);
}

bool possible(int len, int pos) {
    while (1) {
        if (pos + len >= m) return true;
        int nxt = std::upper_bound(p, p + n, pos + len) - p - 1;
        if (nxt == -1 || p[nxt] <= pos) return false;
        len = p[nxt] - pos;
        pos = p[nxt];
    }
}

int minLength(int D) {
    int ans = 0;
    for (int i = (1 << 29); i; i >>= 1)
        ans += !possible(ans + i - 1, D) * i;
    return ans;
}

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:14:12: warning: unused variable 'max_code' [-Wunused-variable]
   14 |  long long max_code;
      |            ^~~~~~~~
grader.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
grader.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |   scanf("%d", &P[i]);
      |   ~~~~~^~~~~~~~~~~~~
grader.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
grader.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |   scanf("%d", &d);
      |   ~~~~~^~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 1900 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 1900 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 1900 KB Output isn't correct
2 Halted 0 ms 0 KB -