oj.uz

Submission #969093

# Submission time Handle Problem Language Result Execution time Memory
969093 2024-04-24T13:32:32 Z CyberCow A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 1 ms 596 KB 
#include "books.h"
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>

using namespace std;
using ll = long long;
const int N = 100010;
long long v[N];

void solve(int n, int k, long long a, int s) {
    ll sum = 0;
    for (int i = 1; i <= k - 1; i++)
    {
        v[i] = skim(i);
        sum += v[i];
    }
    int l = k, r = n, m = 0, ans;
    while (l <= r)
    {
        m = (l + r) / 2;
        ll x = skim(m);
        if (sum + x <= 2 * a && sum + x >= a)
        {
            vector<int> ans;
            for (int j = 1; j < k; j++)
            {
                ans.push_back(j);
            }
            ans.push_back(m);
            answer(ans);
            return;
        }
        else if (sum + x > 2 * a)
        {
            r = m - 1;
        }
        else
        {
            l = m + 1;
        }
    }
    impossible();
}

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:20:30: warning: unused variable 'ans' [-Wunused-variable]
   20 |     int l = k, r = n, m = 0, ans;
      |                              ^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 344 KB Incorrect
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 596 KB Output is correct
3 Incorrect 0 ms 344 KB Incorrect
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Incorrect 0 ms 344 KB Incorrect
9 Halted 0 ms 0 KB -