| Task: | Tikut | 
| Sender: | PMak | 
| Submission time: | 2024-11-09 23:36:08 +0200 | 
| Language: | C++ (C++17) | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | WRONG ANSWER | 0 | 
| #2 | WRONG ANSWER | 0 | 
| #3 | WRONG ANSWER | 0 | 
| #4 | WRONG ANSWER | 0 | 
| #5 | WRONG ANSWER | 0 | 
| #6 | WRONG ANSWER | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | 1, 3, 4, 5, 6 | details | 
| #2 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details | 
| #3 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details | 
| #4 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details | 
| #5 | WRONG ANSWER | 0.01 s | 2, 5, 6 | details | 
| #6 | WRONG ANSWER | 0.00 s | 2, 5, 6 | details | 
| #7 | TIME LIMIT EXCEEDED | -- | 3, 5, 6 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 3, 5, 6 | details | 
| #9 | WRONG ANSWER | 0.83 s | 3, 5, 6 | details | 
| #10 | WRONG ANSWER | 0.05 s | 3, 5, 6 | details | 
| #11 | WRONG ANSWER | 0.00 s | 3, 5, 6 | details | 
| #12 | WRONG ANSWER | 0.28 s | 4, 5, 6 | details | 
| #13 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details | 
| #14 | WRONG ANSWER | 0.01 s | 4, 5, 6 | details | 
| #15 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details | 
| #16 | TIME LIMIT EXCEEDED | -- | 5, 6 | details | 
| #17 | TIME LIMIT EXCEEDED | -- | 5, 6 | details | 
| #18 | TIME LIMIT EXCEEDED | -- | 5, 6 | details | 
| #19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details | 
| #20 | TIME LIMIT EXCEEDED | -- | 6 | details | 
| #21 | TIME LIMIT EXCEEDED | -- | 6 | details | 
| #22 | TIME LIMIT EXCEEDED | -- | 6 | details | 
Compiler report
input/code.cpp:22:19: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   22 | void print(vector<auto> v) {
      |                   ^~~~
input/code.cpp:28:21: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   28 | void print(multiset<auto> v) {
      |                     ^~~~
input/code.cpp: In function 'void solve(std::multiset<int>, int)':
input/code.cpp:37:30: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |     if (k == M+1 || a.size() != N+k)
      |                     ~~~~~~~~~^~~~~~
input/code.cpp:36:9: warning: variable 't' set but not used [-Wunused-but-set-variable]
   36 |     int t, mx, mn, diff;
      |         ^
input/code.cpp:36:12: warning: unused variable 'mx' [-Wunused-variable]
   36 |     int t, mx, mn, diff;
      |            ^~
input/code.cpp:36:16: war...Code
#include <bits/stdc++.h>
#define F0R(i, n) for (i=0; i<n; i++)
#define FOR(from, to) for (int i = from; i < to; i++)
#define R0F(n) for (int i = n; i>=0; --i)
#define ROF(from, to) for (int i = from; i >= to; --i)
#define ll long long
#define mod (int) (1e9 + 7)
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define pii pair<int, int>
#define pci pair<char, int>
#define pll pair<ll, ll>
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
void print(vector<auto> v) {
	for (auto it = v.begin(); it != v.end(); ++it)
		cout << *it << " ";
	cout << "\n";
}
void print(multiset<auto> v) {
	for (auto it = v.begin(); it != v.end(); ++it)
		cout << *it << " ";
	cout << "\n";
}
vi ans(5, 1e9); int N, M;
void solve(multiset<int> a, int k) { // k = cuts made already
    int t, mx, mn, diff;
    if (k == M+1 || a.size() != N+k)
        return;
    printf("k=%d: ", k); print(a);
    set<int> st;
    multiset<int> mst;
    for (auto x : a) st.insert(x), mst.insert(x);
    for (auto x : st) {
        FOR (1, x/2+1) {
            t = x;
            mst.erase(x);
            mst.insert(i);
            mst.insert(x-i);
            diff = *--mst.end() - *mst.begin();
            ans[k+1] = min(diff, ans[k+1]);
            solve(mst, k+1);
            mst.erase(i); mst.erase(x-i);
            mst.insert(x);
        }
    }
}
int main() {
    // ios_base::sync_with_stdio(false);
    // cin.tie(NULL);
    int n, m, i;
    cin >> n >> m;
    M=m; N=n;
    vi a(n);
    F0R (i, n) cin >> a[i];
    multiset<int> st;
    F0R (i, n) st.insert(a[i]);
    solve(st, 0);
    /*vi ans(m);
    int t;
    F0R (m) {
        t = *--st.end();
        st.erase(st.find(t));
        st.insert(t/2);
        st.insert(t-t/2);
        // print(st);
        ans[i] = *--st.end() - *st.begin();
    }
    print(ans);*/
    FOR (1, m+1)
        cout << ans[i] << " ";
    return 0;
}
Test details
Test 1
Group: 1, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1 1 6  | 
| correct output | 
|---|
| 0 | 
| user output | 
|---|
| k=0: 6  k=1: 1 5 k=1: 2 4 k=1: 3 3 0  | 
Test 2
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 5 10 4 8 6 2 7  | 
| correct output | 
|---|
| 5 4 2 2 2 1 1 1 1 1 | 
| user output | 
|---|
| k=0: 2 4 6 7 8  k=1: 1 1 4 6 7 8 k=2: 1 1 1 3 6 7 8 k=3: 1 1 1 1 2 6 7 8 k=4: 1 1 1 1 1 1 6 7 8 ...  | 
Test 3
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 5 10 5 5 8 6 7  | 
| correct output | 
|---|
| 3 3 2 3 2 2 1 1 1 2 | 
| user output | 
|---|
| k=0: 5 5 6 7 8  0 1000000000 1000000000 100000...  | 
Test 4
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 5 10 8 7 9 6 10  | 
| correct output | 
|---|
| 4 4 3 3 2 2 1 2 2 1 | 
| user output | 
|---|
| k=0: 6 7 8 9 10  k=1: 1 5 7 8 9 10 k=2: 1 1 4 7 8 9 10 k=3: 1 1 1 3 7 8 9 10 k=4: 1 1 1 1 2 7 8 9 10 ...  | 
Test 5
Group: 2, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ...  | 
| correct output | 
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... | 
| user output | 
|---|
| k=0: 1 1 1 1 1 1 1 1 1 1 1 1 1... | 
Test 6
Group: 2, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ...  | 
| correct output | 
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... | 
| user output | 
|---|
| k=0: 2 2 2 2 2 2 2 2 2 2 2 2 2... | 
Test 7
Group: 3, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 2 15 710 210 347 398 66 318 277 ...  | 
| correct output | 
|---|
| 994 994 | 
| user output | 
|---|
| (empty) | 
Test 8
Group: 3, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 2 743 890 592 942 736 969 616 50...  | 
| correct output | 
|---|
| 498 496 | 
| user output | 
|---|
| (empty) | 
Test 9
Group: 3, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 2 987 968 920 994 988 918 914 95...  | 
| correct output | 
|---|
| 500 500 | 
| user output | 
|---|
| k=0: 900 900 900 900 900 900 9... | 
Test 10
Group: 3, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 2 996 1000 998 998 999 997 997 9...  | 
| correct output | 
|---|
| 500 500 | 
| user output | 
|---|
| k=0: 995 995 995 995 995 995 9... | 
Test 11
Group: 3, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 2 501 501 501 501 501 501 501 50...  | 
| correct output | 
|---|
| 1 168 | 
| user output | 
|---|
| k=0: 501 501 501 501 501 501 5... | 
Test 12
Group: 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 100 200 145 136 74 83 73 36 196 115 11...  | 
| correct output | 
|---|
| 194 190 189 183 182 181 181 17... | 
| user output | 
|---|
| k=0: 2 4 7 8 9 13 13 18 20 22 ... | 
Test 13
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 200 157 110 168 155 192 107 146 15...  | 
| correct output | 
|---|
| 95 96 96 95 93 94 94 94 90 91 ... | 
| user output | 
|---|
| (empty) | 
Test 14
Group: 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 50 200 137 118 160 118 146 160 140 18...  | 
| correct output | 
|---|
| 98 98 98 96 90 91 88 88 84 86 ... | 
| user output | 
|---|
| k=0: 100 100 102 102 104 105 1... | 
Test 15
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100 200 147 174 186 148 155 128 158 18...  | 
| correct output | 
|---|
| 99 99 98 98 97 97 96 96 95 95 ... | 
| user output | 
|---|
| (empty) | 
Test 16
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 2000 928772177 816188227 216592201 ...  | 
| correct output | 
|---|
| 991676844 990940224 990685481 ... | 
| user output | 
|---|
| (empty) | 
Test 17
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 2000 665759876 597950008 615453266 ...  | 
| correct output | 
|---|
| 498801198 498681904 498504321 ... | 
| user output | 
|---|
| (empty) | 
Test 18
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 500 2000 683288817 784230412 626685186 ...  | 
| correct output | 
|---|
| 497667621 498434895 495465990 ... | 
| user output | 
|---|
| (empty) | 
Test 19
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 2000 666667000 809309500 571572000 ...  | 
| correct output | 
|---|
| 499499500 499249250 498999000 ... | 
| user output | 
|---|
| (empty) | 
Test 20
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100000 200000 861772559 734298084 983382252 ...  | 
| correct output | 
|---|
| 499973914 499985299 499985141 ... | 
| user output | 
|---|
| (empty) | 
Test 21
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 30000 200000 691834579 617419813 514778075 ...  | 
| correct output | 
|---|
| 499967533 499976270 499969810 ... | 
| user output | 
|---|
| (empty) | 
Test 22
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 100000 200000 820255000 960780000 741965000 ...  | 
| correct output | 
|---|
| 499995000 499992500 499990000 ... | 
| user output | 
|---|
| (empty) | 
