oj.uz

Submission #772300

# Submission time Handle Problem Language Result Execution time Memory
772300 2023-07-03T23:29:06 Z tolbi A Difficult(y) Choice (BOI21_books) C++17
100 / 100
 1 ms 1104 KB 
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz!..
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& is, pair<X,Y> &pr){return is>>pr.first>>pr.second;}
template<typename X, size_t Y> istream& operator>>(istream& is, array<X,Y> arr){for (auto &it : arr) is>>it; return is;}
template<typename T> istream& operator>>(istream& is, vector<T> arr){for (auto &it : arr) is>>it; return is;}
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define endl '\n'
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define vint(x) vector<int> x
#define cinarr(x) for(auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1LL<<((int)(bi)))
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
void impossible();
void answer(vector<int32_t> v);
long long skim(int32_t pos);
vector<int> convert(deque<int> dq){
	vector<int> aa;
	while (dq.size()) aa.push_back(dq.back()),dq.pop_back();
	return aa;
}
long long fiss;
bool fits(long long num){
	return (num>=fiss && num<=fiss*2);
}
void solve(int n, int k, long long a, int s){
	fiss=a;
	int l = 1, r = n;
	long long cr = skim(n);
	long long pos = n+1;
	long long hayd=-23;
	if (cr>=a){
		while (l<r){
			int mid = l+(r-l)/2;
			long long crr = skim(mid);
			if (crr>=a){
				r=mid;
			}
			else {
				l=mid+1;
			}
		}
		pos=r;
		hayd=skim(pos);
	}
	vector<long long> deg(n+1);
	vector<long long> bas;
	vector<long long> son;
	if (pos<k) impossible();
	for (int i = 0; i < k; i++){
		if (i+1>n || i+1<1 || pos-i-1<1 || pos-i-1>n) continue;
		deg[i+1]=skim(i+1);
		deg[pos-i-1]=skim(pos-i-1);
		bas.push_back(i+1);
		son.push_back(pos-i-1);
	}
	deque<int> crarr;
	long long somma = 0;
	for (int i = 0; i < k-1; ++i)
	{
		crarr.push_back(bas[i]);
		somma+=deg[bas[i]];
	}
	if (hayd!=-23){
		if (somma+hayd>=a && somma+hayd<=2*a){
			vector<int> ans;
			while (crarr.size()) ans.push_back(crarr.back()),crarr.pop_back();
			ans.push_back(pos);
			answer(ans);
		}
	}
	crarr.push_back(bas.back());
	somma+=deg[bas.back()];
	if (fits(somma)) answer(convert(crarr));
	for (int i = 0; i < k; i++){
		somma-=deg[crarr.front()];
		crarr.pop_front();
		somma+=deg[son[i]];
		crarr.push_back(son[i]);
		if (fits(somma)) answer(convert(crarr));
	}
	impossible();
}

Compilation message

books.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 1 ms 428 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 420 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1048 KB Output is correct
2 Correct 1 ms 1052 KB Output is correct
3 Correct 1 ms 1052 KB Output is correct
4 Correct 1 ms 1064 KB Output is correct
5 Correct 1 ms 1064 KB Output is correct
6 Correct 1 ms 1072 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 1048 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1048 KB Output is correct
2 Correct 1 ms 1052 KB Output is correct
3 Correct 1 ms 1052 KB Output is correct
4 Correct 1 ms 1064 KB Output is correct
5 Correct 1 ms 1064 KB Output is correct
6 Correct 1 ms 1072 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 1048 KB Output is correct
10 Correct 1 ms 1068 KB Output is correct
11 Correct 1 ms 1056 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 1064 KB Output is correct
14 Correct 1 ms 1064 KB Output is correct
15 Correct 1 ms 1060 KB Output is correct
16 Correct 1 ms 1060 KB Output is correct
17 Correct 1 ms 1064 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 1064 KB Output is correct
20 Correct 1 ms 1068 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 1052 KB Output is correct
23 Correct 1 ms 1068 KB Output is correct
24 Correct 1 ms 1068 KB Output is correct
25 Correct 1 ms 1104 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1048 KB Output is correct
2 Correct 1 ms 1052 KB Output is correct
3 Correct 1 ms 1052 KB Output is correct
4 Correct 1 ms 1064 KB Output is correct
5 Correct 1 ms 1064 KB Output is correct
6 Correct 1 ms 1072 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 1048 KB Output is correct
10 Correct 1 ms 1068 KB Output is correct
11 Correct 1 ms 1056 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 1064 KB Output is correct
14 Correct 1 ms 1064 KB Output is correct
15 Correct 1 ms 1060 KB Output is correct
16 Correct 1 ms 1060 KB Output is correct
17 Correct 1 ms 1064 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 1064 KB Output is correct
20 Correct 1 ms 1068 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 1052 KB Output is correct
23 Correct 1 ms 1068 KB Output is correct
24 Correct 1 ms 1068 KB Output is correct
25 Correct 1 ms 1104 KB Output is correct
26 Correct 1 ms 1048 KB Output is correct
27 Correct 1 ms 1056 KB Output is correct
28 Correct 1 ms 1064 KB Output is correct
29 Correct 1 ms 1068 KB Output is correct
30 Correct 1 ms 1064 KB Output is correct
31 Correct 1 ms 1060 KB Output is correct
32 Correct 1 ms 1060 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 1 ms 1052 KB Output is correct
35 Correct 1 ms 1048 KB Output is correct
36 Correct 1 ms 968 KB Output is correct
37 Correct 1 ms 1056 KB Output is correct
38 Correct 1 ms 1052 KB Output is correct
39 Correct 1 ms 1064 KB Output is correct
40 Correct 1 ms 1048 KB Output is correct
41 Correct 1 ms 1048 KB Output is correct
42 Correct 1 ms 968 KB Output is correct
43 Correct 1 ms 1048 KB Output is correct
44 Correct 1 ms 1048 KB Output is correct
45 Correct 1 ms 1056 KB Output is correct
46 Correct 1 ms 968 KB Output is correct
47 Correct 1 ms 1056 KB Output is correct
48 Correct 1 ms 1052 KB Output is correct
49 Correct 1 ms 1064 KB Output is correct
50 Correct 1 ms 1052 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1048 KB Output is correct
2 Correct 1 ms 1052 KB Output is correct
3 Correct 1 ms 1052 KB Output is correct
4 Correct 1 ms 1064 KB Output is correct
5 Correct 1 ms 1064 KB Output is correct
6 Correct 1 ms 1072 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 1048 KB Output is correct
10 Correct 1 ms 1068 KB Output is correct
11 Correct 1 ms 1056 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 1064 KB Output is correct
14 Correct 1 ms 1064 KB Output is correct
15 Correct 1 ms 1060 KB Output is correct
16 Correct 1 ms 1060 KB Output is correct
17 Correct 1 ms 1064 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 1064 KB Output is correct
20 Correct 1 ms 1068 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 1052 KB Output is correct
23 Correct 1 ms 1068 KB Output is correct
24 Correct 1 ms 1068 KB Output is correct
25 Correct 1 ms 1104 KB Output is correct
26 Correct 1 ms 1064 KB Output is correct
27 Correct 1 ms 1064 KB Output is correct
28 Correct 1 ms 1048 KB Output is correct
29 Correct 1 ms 1052 KB Output is correct
30 Correct 1 ms 968 KB Output is correct
31 Correct 1 ms 1060 KB Output is correct
32 Correct 1 ms 1056 KB Output is correct
33 Correct 1 ms 1056 KB Output is correct
34 Correct 1 ms 1056 KB Output is correct
35 Correct 1 ms 968 KB Output is correct
36 Correct 1 ms 1060 KB Output is correct
37 Correct 1 ms 1056 KB Output is correct
38 Correct 1 ms 1044 KB Output is correct
39 Correct 1 ms 1076 KB Output is correct
40 Correct 1 ms 1076 KB Output is correct
41 Correct 1 ms 1072 KB Output is correct
42 Correct 1 ms 1052 KB Output is correct
43 Correct 1 ms 1068 KB Output is correct
44 Correct 1 ms 976 KB Output is correct
45 Correct 1 ms 976 KB Output is correct
46 Correct 1 ms 1064 KB Output is correct
47 Correct 1 ms 1060 KB Output is correct
48 Correct 1 ms 1072 KB Output is correct
49 Correct 1 ms 976 KB Output is correct
50 Correct 1 ms 976 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1048 KB Output is correct
2 Correct 1 ms 1052 KB Output is correct
3 Correct 1 ms 1052 KB Output is correct
4 Correct 1 ms 1064 KB Output is correct
5 Correct 1 ms 1064 KB Output is correct
6 Correct 1 ms 1072 KB Output is correct
7 Correct 1 ms 976 KB Output is correct
8 Correct 1 ms 968 KB Output is correct
9 Correct 1 ms 1048 KB Output is correct
10 Correct 1 ms 1068 KB Output is correct
11 Correct 1 ms 1056 KB Output is correct
12 Correct 1 ms 968 KB Output is correct
13 Correct 1 ms 1064 KB Output is correct
14 Correct 1 ms 1064 KB Output is correct
15 Correct 1 ms 1060 KB Output is correct
16 Correct 1 ms 1060 KB Output is correct
17 Correct 1 ms 1064 KB Output is correct
18 Correct 1 ms 976 KB Output is correct
19 Correct 1 ms 1064 KB Output is correct
20 Correct 1 ms 1068 KB Output is correct
21 Correct 1 ms 968 KB Output is correct
22 Correct 1 ms 1052 KB Output is correct
23 Correct 1 ms 1068 KB Output is correct
24 Correct 1 ms 1068 KB Output is correct
25 Correct 1 ms 1104 KB Output is correct
26 Correct 1 ms 1048 KB Output is correct
27 Correct 1 ms 1056 KB Output is correct
28 Correct 1 ms 1064 KB Output is correct
29 Correct 1 ms 1068 KB Output is correct
30 Correct 1 ms 1064 KB Output is correct
31 Correct 1 ms 1060 KB Output is correct
32 Correct 1 ms 1060 KB Output is correct
33 Correct 1 ms 976 KB Output is correct
34 Correct 1 ms 1052 KB Output is correct
35 Correct 1 ms 1048 KB Output is correct
36 Correct 1 ms 968 KB Output is correct
37 Correct 1 ms 1056 KB Output is correct
38 Correct 1 ms 1052 KB Output is correct
39 Correct 1 ms 1064 KB Output is correct
40 Correct 1 ms 1048 KB Output is correct
41 Correct 1 ms 1048 KB Output is correct
42 Correct 1 ms 968 KB Output is correct
43 Correct 1 ms 1048 KB Output is correct
44 Correct 1 ms 1048 KB Output is correct
45 Correct 1 ms 1056 KB Output is correct
46 Correct 1 ms 968 KB Output is correct
47 Correct 1 ms 1056 KB Output is correct
48 Correct 1 ms 1052 KB Output is correct
49 Correct 1 ms 1064 KB Output is correct
50 Correct 1 ms 1052 KB Output is correct
51 Correct 1 ms 1064 KB Output is correct
52 Correct 1 ms 1064 KB Output is correct
53 Correct 1 ms 1048 KB Output is correct
54 Correct 1 ms 1052 KB Output is correct
55 Correct 1 ms 968 KB Output is correct
56 Correct 1 ms 1060 KB Output is correct
57 Correct 1 ms 1056 KB Output is correct
58 Correct 1 ms 1056 KB Output is correct
59 Correct 1 ms 1056 KB Output is correct
60 Correct 1 ms 968 KB Output is correct
61 Correct 1 ms 1060 KB Output is correct
62 Correct 1 ms 1056 KB Output is correct
63 Correct 1 ms 1044 KB Output is correct
64 Correct 1 ms 1076 KB Output is correct
65 Correct 1 ms 1076 KB Output is correct
66 Correct 1 ms 1072 KB Output is correct
67 Correct 1 ms 1052 KB Output is correct
68 Correct 1 ms 1068 KB Output is correct
69 Correct 1 ms 976 KB Output is correct
70 Correct 1 ms 976 KB Output is correct
71 Correct 1 ms 1064 KB Output is correct
72 Correct 1 ms 1060 KB Output is correct
73 Correct 1 ms 1072 KB Output is correct
74 Correct 1 ms 976 KB Output is correct
75 Correct 1 ms 976 KB Output is correct
76 Correct 1 ms 308 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 1 ms 208 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 1 ms 208 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Correct 1 ms 432 KB Output is correct
85 Correct 1 ms 428 KB Output is correct
86 Correct 1 ms 464 KB Output is correct
87 Correct 1 ms 464 KB Output is correct
88 Correct 1 ms 464 KB Output is correct
89 Correct 1 ms 464 KB Output is correct
90 Correct 1 ms 464 KB Output is correct
91 Correct 1 ms 464 KB Output is correct
92 Correct 1 ms 1064 KB Output is correct
93 Correct 1 ms 1052 KB Output is correct
94 Correct 1 ms 968 KB Output is correct
95 Correct 1 ms 1052 KB Output is correct
96 Correct 1 ms 968 KB Output is correct
97 Correct 1 ms 1072 KB Output is correct
98 Correct 1 ms 1068 KB Output is correct
99 Correct 1 ms 1076 KB Output is correct
100 Correct 1 ms 1060 KB Output is correct
101 Correct 1 ms 1052 KB Output is correct
102 Correct 1 ms 1068 KB Output is correct
103 Correct 1 ms 976 KB Output is correct
104 Correct 1 ms 1048 KB Output is correct
105 Correct 1 ms 1068 KB Output is correct
106 Correct 1 ms 976 KB Output is correct
107 Correct 1 ms 1076 KB Output is correct
108 Correct 1 ms 1048 KB Output is correct
109 Correct 1 ms 1052 KB Output is correct
110 Correct 1 ms 1064 KB Output is correct
111 Correct 1 ms 1064 KB Output is correct
112 Correct 1 ms 1064 KB Output is correct
113 Correct 1 ms 1064 KB Output is correct
114 Correct 1 ms 1072 KB Output is correct
115 Correct 1 ms 1068 KB Output is correct
116 Correct 1 ms 1072 KB Output is correct
117 Correct 1 ms 1060 KB Output is correct
118 Correct 1 ms 1048 KB Output is correct
119 Correct 1 ms 976 KB Output is correct
120 Correct 1 ms 968 KB Output is correct
121 Correct 1 ms 1060 KB Output is correct
122 Correct 1 ms 1056 KB Output is correct
123 Correct 1 ms 1060 KB Output is correct
124 Correct 1 ms 1068 KB Output is correct
125 Correct 1 ms 1068 KB Output is correct
126 Correct 1 ms 1056 KB Output is correct
127 Correct 1 ms 1048 KB Output is correct
128 Correct 1 ms 1056 KB Output is correct
129 Correct 1 ms 1064 KB Output is correct
130 Correct 1 ms 1068 KB Output is correct
131 Correct 1 ms 968 KB Output is correct
132 Correct 1 ms 1060 KB Output is correct
133 Correct 1 ms 1096 KB Output is correct
134 Correct 1 ms 1060 KB Output is correct
135 Correct 1 ms 1076 KB Output is correct