oj.uz

Submission #969054

# Submission time Handle Problem Language Result Execution time Memory
969054 2024-04-24T12:38:33 Z CyberCow A Difficult(y) Choice (BOI21_books) C++17
20 / 100
 136 ms 3608 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);
            }
            ans.push_back(i);
            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
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 4 ms 728 KB Output is correct
3 Correct 4 ms 724 KB Output is correct
4 Correct 4 ms 1416 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 5 ms 1256 KB Output is correct
7 Correct 4 ms 996 KB Output is correct
8 Correct 6 ms 996 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 4 ms 492 KB Output is correct
3 Correct 4 ms 988 KB Output is correct
4 Correct 5 ms 492 KB Output is correct
5 Correct 4 ms 744 KB Output is correct
6 Correct 4 ms 988 KB Output is correct
7 Correct 4 ms 744 KB Output is correct
8 Correct 4 ms 452 KB Output is correct
9 Correct 136 ms 2976 KB Output is correct
10 Correct 113 ms 3068 KB Output is correct
11 Correct 135 ms 3076 KB Output is correct
12 Correct 130 ms 2656 KB Output is correct
13 Correct 109 ms 3608 KB Output is correct
14 Correct 125 ms 3088 KB Output is correct
15 Correct 112 ms 2632 KB Output is correct
16 Correct 132 ms 2472 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 436 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 436 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 436 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 436 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 436 KB Execution killed with signal 13
2 Halted 0 ms 0 KB -