제출 #710379

#제출 시각아이디문제언어결과실행 시간메모리
710379Radin_Zahedi2A Difficult(y) Choice (BOI21_books)C++17
0 / 100
1 ms208 KiB
#include<bits/stdc++.h>
#include<books.h>
using namespace std;
using ll = long long;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int)x.size()
//#define endl '\n'


void solve(int n, int k, ll a, int s) {
    ll begs[k + 1];
    ll ends[k + 1];

    for (int i = 1; i <= k; i++) {
	begs[i] = skim(i);
    }

    for (int i = 1; i <= k; i++) {
	ends[i] = skim(n + 1 - i);
    }

    for (int i = 2; i <= k; i++) {
	begs[i] += begs[i - 1];
	ends[i] += ends[i - 1];
    }



}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...