제출 #575049

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

books

#include<bits/stdc++.h>
#include<books.h>
using namespace std;
using ll = long long;
using db = double;
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
#define f first
#define s second
const int MOD = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);
 
void solve(int n, int k, ll a, int s){
    
    vector<ll> vec(n+1);
    
    for(ll i = 1; i <= n; i++){
        
        vec[i] = skim(i);
    }
    
    ll sum = 0;
    
    vector<int> temp;
    
    for(ll i = 1; i <= n; i++){
        
        if(sum < a or sz(temp) < k){
            
            if(sz(temp)<k){
                
                if(sum + vec[i] <= 2*a){
                    
                    sum+=vec[i];
                    temp.pb(i);
                }
            }
        }
    }
    
    if(sum>=a and sum<=2*a and sz(temp)==k){
            
        answer(temp);
    }
    
    else impossible();
    // answer(temp);
    
    
}
// 
// int main(){
// 
//     solve(5, 3, 10, 0);
// }

• 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