| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 746885 | anusha777 | A Difficult(y) Choice (BOI21_books) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "books.h"
#include <bits/stdc++.h>
#define fast ios::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL)
#define sz(x) (int)((x).size())
#define pb push_back
#define vi vector<int>
#define vb vector<bool>
#define vvb vector<vb>
#define pi pair<int,int>
#define vpi vector<pi>
#define vvi vector<vi>
#define vc vector<char>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pbb() pop_back()
#define f first
//#define s second
#define ll long long
//#define int long long
#define ull unsigned long long
#define forr(i, a, b) for(int i=a; i<b; i++)
const int N=120000+1, mod=1e9 + 9, inf=1e27+1;
using namespace std;
//vi dx= { 0, 1, 0 , -1} , dy= {-1,0, 1, 0};
void solve2(int n, int k, ll a , int s)
{
vector<ll> p(n+1);
forr(i, 1, n+1) p[i]= p[i-1] + skim(i);
forr(i, k, n+1) if(p[i]-p[k]>=a and p[i]-p[k]<=2*a)
{
vi v;
forr(j, i-k, i+1) a.pb(j);
answer(v);
}
impossible();
}
void solve(int n, int k, ll a , int s)
{
if(n==s) solve2(n, k,a ,s);
}
//signed main()
//{
// fast;
// int t;
// t=1;
// //cin>>t;
// while(t--) task();
//}