oj.uz

Submission #969053

# Submission time Handle Problem Language Result Execution time Memory
969053 2024-04-24T12:37:55 Z CyberCow A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 6 ms 1204 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) {

    set<pair<long long, int>> se;
    for (int i = 1; i <= n; i++)
    {
        v[i] = skim(i);
        se.insert({ v[i], i });
    }
    int st = 0;
    ll sum = 0;
    for (int i = 1; i <= k; i++)
    {
        sum += v[i];
    }
    for (int i = k; i <= n; i++)
    {
        if (sum >= a && sum <= 2 * a)
        {
            vector<int> ans;
            for (int j = i - k + 1; j <= i; j++)
            {
                ans.push_back(j);
            }
            answer(ans);
            return;
        }
        sum += v[i + 1] - v[i - k + 1];
    }
    sum = 0;
    for (int i = 1; i <= k - 1; i++)
    {
        sum += v[i];
    }
    for (int i = k; i <= n; i++)
    {
        if (sum + v[i] >= a && sum + v[i] <= 2 * a)
        {
            vector<int> ans;
            for (int j = 1; j < k; j++)
            {
                ans.push_back(j);
            }
            answer(ans);
            return;
        }
    }
    impossible();
}

Compilation message

books.cpp: In function 'void solve(int, int, long long int, int)':
books.cpp:21:9: warning: unused variable 'st' [-Wunused-variable]
   21 |     int st = 0;
      |         ^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 4 ms 748 KB Output is correct
3 Correct 4 ms 496 KB Output is correct
4 Correct 4 ms 488 KB Output is correct
5 Correct 4 ms 912 KB Output is correct
6 Incorrect 5 ms 624 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 4 ms 736 KB Output is correct
3 Correct 4 ms 752 KB Output is correct
4 Correct 6 ms 1204 KB Output is correct
5 Correct 4 ms 708 KB Output is correct
6 Incorrect 5 ms 732 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 440 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 440 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 440 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 440 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 440 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -