제출 #772979

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
772979		Imeon	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	2 ms	1080 KiB

books

#include<bits/stdc++.h>
#include"books.h"
using namespace std;
void solve(int N, int K, long long A, int S) {
   // cin >> N >> K >> S >> A;   
   
    long long x[N + 1];
    long long sm = 0;
    int f = 0;
    K--;
    for (int i = 1; i < 2;i++){
   // cin >> x[i];
        //x[i] = skim(i);
        sm += x[i];
        f++;
        if (f > K){sm -= x[i - K - 1];}
        int l = K,r = N + 1;
        if (f >= K){
        while (l + 1 < r){
            int md = (l + r) / 2;
            if ((x[md] + sm) > 2ll * A)r = md;
            else l = md;
         }
         sm += x[l];
        }
        if (f >= K and sm >= A and sm <= 2LL * A){
            vector<int>v;
            v.push_back(l);
            for (int j = i - K; j <= i; j++){
           //     cout << j << " ";
                v.push_back(j);
            }
           // cout << '\n';
            answer(v);
        } 
    }
    K++;
    f = 0;
    sm = 0;
    for (int i = 1; i <= S + 1;i++){
   // cin >> x[i];
        x[i] = skim(i);
        sm += x[i];
        f++;
        if (f > K){sm -= x[i - K - 1];}
        if (f >= K and sm >= A and sm <= 2LL * A){
            vector<int>v;
            for (int j = i - K; j <= i; j++){
           //     cout << j << " ";
                v.push_back(j);
            }
           // cout << '\n';
            answer(v);
        }
    }
     //   cout << -1;
        impossible();
 
} 

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20