oj.uz

답안 #512671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
512671 2022-01-16T16:09:58 Z Wayne_Yan A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 1 ms 416 KB 
#include <bits/stdc++.h>
#include "books.h"
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define RF(n) RFi(i,n)
#define RFi(i,n) RFl(i,0,n)
#define RFl(i,l,n) for(int i=n-1;i>=l;i--)
#define all(v) begin(v),end(v)
#define siz(v) (ll(v.size()))
#define get_pos(v,x) (lower_bound(all(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define mem(v,x) memset(v,x,sizeof v)
#define ff first
#define ss second
#define RAN(a,b) uniform_int_distribution<int> (a, b)(rng)
#define debug(x) (cerr << (#x) << " = " << x << "\n")
#define cmax(a,b) (a = max(a,b))
#define cmin(a,b) (a = min(a,b))

using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

// N: number of books, K: final set size, A: target sum is from A to 2*A, S: query time
// long long skim(int a) : returns x_a;
// void impossible();
// void answer(vector<int> v);

long long arr[100010];
int SSSS, NNNN;
int skimcnt;
set<int> searched;

long long aux(int i){

  
  if(arr[i]) return arr[i];

  searched.insert(i);

  arr[i] = skim(i);
  skimcnt++;

  return arr[i];
}

void reset(){
  skimcnt = 0;
  SSSS = 0;
  NNNN = 0;
  for(int i : searched){
    arr[i] = 0;
  }
  searched.clear();
}

void solve(int N, int K, long long A, int S) {
  SSSS = S;
  NNNN = N;
  F(K-1) aux(i+1);

  int boundL = 0, boundR = N + 1;
  while(boundL + 1 != boundR){
    int mid = (boundL + boundR) >> 1;
    if(aux(mid) >= A){
      boundR = mid;
    }else{
      boundL = mid;
    }
  }

  if(boundR < K) {reset(); impossible();}
  
  if(boundR <= N){
    long long temp1 =  aux(boundR);
    F(K-1) temp1 += aux(i+1);
    if(temp1 >= A && temp1 <= 2*A){
      vector<int> v;
      v.pb(boundR);
      F(K-1) v.pb(i+1);
      reset();
      answer(v);
    }
  }
  
  long long mx = 0;
  F(K) mx += aux(boundL - i);

  long long mn = 0;
  F(K) mn += aux(i+1);

  if(mn > 2*A || mx < A) {reset(); impossible();}

  F(K+1){
    
    long long curr = 0;
    vector<int> v;
    Fi(j, i) curr += aux(j+1), v.pb(j+1);
    Fi(j, K-i) curr += aux(boundL - j), v.pb(boundL-j);

    if( 2*A >= curr && curr >= A) {reset(); answer(v);}


  }
  

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 0 ms 200 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 200 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 300 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 280 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 0 ms 280 KB Output is correct
15 Correct 1 ms 408 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 1 ms 284 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 312 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 280 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 0 ms 280 KB Output is correct
15 Correct 1 ms 408 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 1 ms 284 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 280 KB Output is correct
28 Correct 1 ms 300 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 284 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 280 KB Output is correct
33 Correct 1 ms 284 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 272 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 1 ms 288 KB Output is correct
38 Correct 1 ms 284 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 1 ms 292 KB Output is correct
41 Correct 1 ms 292 KB Output is correct
42 Correct 1 ms 292 KB Output is correct
43 Correct 1 ms 312 KB Output is correct
44 Correct 1 ms 292 KB Output is correct
45 Correct 1 ms 292 KB Output is correct
46 Correct 1 ms 272 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 1 ms 284 KB Output is correct
49 Correct 1 ms 272 KB Output is correct
50 Correct 1 ms 296 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 280 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 0 ms 280 KB Output is correct
15 Correct 1 ms 408 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 1 ms 284 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 284 KB Output is correct
27 Correct 1 ms 288 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 280 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 292 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 1 ms 296 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 1 ms 284 KB Output is correct
36 Correct 1 ms 284 KB Output is correct
37 Correct 1 ms 288 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 272 KB Output is correct
40 Correct 1 ms 272 KB Output is correct
41 Correct 1 ms 284 KB Output is correct
42 Correct 1 ms 292 KB Output is correct
43 Correct 1 ms 308 KB Output is correct
44 Correct 1 ms 284 KB Output is correct
45 Correct 1 ms 292 KB Output is correct
46 Correct 1 ms 288 KB Output is correct
47 Correct 1 ms 292 KB Output is correct
48 Correct 1 ms 288 KB Output is correct
49 Correct 1 ms 272 KB Output is correct
50 Correct 1 ms 292 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 280 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 284 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 280 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 0 ms 280 KB Output is correct
15 Correct 1 ms 408 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 292 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 292 KB Output is correct
22 Correct 1 ms 284 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 1 ms 280 KB Output is correct
28 Correct 1 ms 300 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 284 KB Output is correct
31 Correct 1 ms 296 KB Output is correct
32 Correct 1 ms 280 KB Output is correct
33 Correct 1 ms 284 KB Output is correct
34 Correct 1 ms 292 KB Output is correct
35 Correct 1 ms 272 KB Output is correct
36 Correct 1 ms 296 KB Output is correct
37 Correct 1 ms 288 KB Output is correct
38 Correct 1 ms 284 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 1 ms 292 KB Output is correct
41 Correct 1 ms 292 KB Output is correct
42 Correct 1 ms 292 KB Output is correct
43 Correct 1 ms 312 KB Output is correct
44 Correct 1 ms 292 KB Output is correct
45 Correct 1 ms 292 KB Output is correct
46 Correct 1 ms 272 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 1 ms 284 KB Output is correct
49 Correct 1 ms 272 KB Output is correct
50 Correct 1 ms 296 KB Output is correct
51 Correct 1 ms 284 KB Output is correct
52 Correct 1 ms 288 KB Output is correct
53 Correct 1 ms 296 KB Output is correct
54 Correct 1 ms 280 KB Output is correct
55 Correct 1 ms 300 KB Output is correct
56 Correct 1 ms 292 KB Output is correct
57 Correct 1 ms 296 KB Output is correct
58 Correct 1 ms 296 KB Output is correct
59 Correct 1 ms 296 KB Output is correct
60 Correct 1 ms 284 KB Output is correct
61 Correct 1 ms 284 KB Output is correct
62 Correct 1 ms 288 KB Output is correct
63 Correct 1 ms 304 KB Output is correct
64 Correct 1 ms 272 KB Output is correct
65 Correct 1 ms 272 KB Output is correct
66 Correct 1 ms 284 KB Output is correct
67 Correct 1 ms 292 KB Output is correct
68 Correct 1 ms 308 KB Output is correct
69 Correct 1 ms 284 KB Output is correct
70 Correct 1 ms 292 KB Output is correct
71 Correct 1 ms 288 KB Output is correct
72 Correct 1 ms 292 KB Output is correct
73 Correct 1 ms 288 KB Output is correct
74 Correct 1 ms 272 KB Output is correct
75 Correct 1 ms 292 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 0 ms 200 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 0 ms 200 KB Output is correct
80 Correct 0 ms 300 KB Output is correct
81 Correct 0 ms 304 KB Output is correct
82 Correct 0 ms 200 KB Output is correct
83 Correct 0 ms 200 KB Output is correct
84 Correct 1 ms 296 KB Output is correct
85 Correct 1 ms 288 KB Output is correct
86 Correct 1 ms 304 KB Output is correct
87 Correct 1 ms 280 KB Output is correct
88 Correct 1 ms 284 KB Output is correct
89 Correct 1 ms 296 KB Output is correct
90 Correct 1 ms 304 KB Output is correct
91 Correct 1 ms 200 KB Output is correct
92 Correct 0 ms 284 KB Output is correct
93 Correct 1 ms 200 KB Output is correct
94 Correct 1 ms 288 KB Output is correct
95 Correct 1 ms 280 KB Output is correct
96 Correct 1 ms 296 KB Output is correct
97 Correct 1 ms 288 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 1 ms 300 KB Output is correct
100 Correct 1 ms 200 KB Output is correct
101 Correct 1 ms 288 KB Output is correct
102 Correct 1 ms 304 KB Output is correct
103 Correct 1 ms 296 KB Output is correct
104 Correct 1 ms 200 KB Output is correct
105 Correct 1 ms 296 KB Output is correct
106 Correct 1 ms 200 KB Output is correct
107 Correct 1 ms 416 KB Output is correct
108 Correct 1 ms 292 KB Output is correct
109 Correct 1 ms 268 KB Output is correct
110 Correct 1 ms 276 KB Output is correct
111 Correct 1 ms 288 KB Output is correct
112 Correct 0 ms 200 KB Output is correct
113 Correct 1 ms 284 KB Output is correct
114 Correct 1 ms 292 KB Output is correct
115 Correct 1 ms 284 KB Output is correct
116 Correct 1 ms 308 KB Output is correct
117 Correct 1 ms 296 KB Output is correct
118 Correct 1 ms 328 KB Output is correct
119 Correct 1 ms 300 KB Output is correct
120 Correct 1 ms 284 KB Output is correct
121 Correct 0 ms 288 KB Output is correct
122 Correct 1 ms 280 KB Output is correct
123 Correct 1 ms 296 KB Output is correct
124 Correct 0 ms 292 KB Output is correct
125 Correct 1 ms 280 KB Output is correct
126 Correct 1 ms 280 KB Output is correct
127 Correct 1 ms 200 KB Output is correct
128 Correct 1 ms 280 KB Output is correct
129 Correct 1 ms 280 KB Output is correct
130 Correct 1 ms 300 KB Output is correct
131 Correct 1 ms 284 KB Output is correct
132 Correct 1 ms 284 KB Output is correct
133 Correct 1 ms 292 KB Output is correct
134 Correct 1 ms 308 KB Output is correct
135 Correct 1 ms 200 KB Output is correct