| Task: | Tikut | 
| Sender: | aatukaj | 
| Submission time: | 2024-10-31 19:17:41 +0200 | 
| Language: | C++ (C++20) | 
| 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.21 s | 1, 3, 4, 5, 6 | details | 
| #2 | WRONG ANSWER | 0.21 s | 1, 4, 5, 6 | details | 
| #3 | WRONG ANSWER | 0.21 s | 1, 4, 5, 6 | details | 
| #4 | WRONG ANSWER | 0.21 s | 1, 4, 5, 6 | details | 
| #5 | WRONG ANSWER | 0.21 s | 2, 5, 6 | details | 
| #6 | WRONG ANSWER | 0.21 s | 2, 5, 6 | details | 
| #7 | WRONG ANSWER | 0.22 s | 3, 5, 6 | details | 
| #8 | WRONG ANSWER | 0.21 s | 3, 5, 6 | details | 
| #9 | WRONG ANSWER | 0.23 s | 3, 5, 6 | details | 
| #10 | WRONG ANSWER | 0.22 s | 3, 5, 6 | details | 
| #11 | WRONG ANSWER | 0.21 s | 3, 5, 6 | details | 
| #12 | WRONG ANSWER | 0.21 s | 4, 5, 6 | details | 
| #13 | WRONG ANSWER | 0.21 s | 4, 5, 6 | details | 
| #14 | WRONG ANSWER | 0.21 s | 4, 5, 6 | details | 
| #15 | WRONG ANSWER | 0.22 s | 4, 5, 6 | details | 
| #16 | WRONG ANSWER | 0.22 s | 5, 6 | details | 
| #17 | WRONG ANSWER | 0.22 s | 5, 6 | details | 
| #18 | WRONG ANSWER | 0.21 s | 5, 6 | details | 
| #19 | WRONG ANSWER | 0.22 s | 5, 6 | details | 
| #20 | WRONG ANSWER | 0.21 s | 6 | details | 
| #21 | WRONG ANSWER | 0.21 s | 6 | details | 
| #22 | WRONG ANSWER | 0.21 s | 6 | details | 
Code
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
// const ll M = 998244353;
const ll M = 1e9 + 7;
// ll M;
#define all(v) (v).begin(), (v).end()
#define ff first
#define ss second
#define PI 3.141592653589793238462643383279502884L
const ll INFL = 1e18;
const int INF = 1e9;
const ll maxN = 5e5+1;
mt19937_64 gen(random_device{}());
uniform_int_distribution<int> dist(1, 1);
int random(int a, int b) {
    dist.param(uniform_int_distribution<int>::param_type(a, b));
    return dist(gen);
}
int cur_mn, cur_mx, ans, n, m;
vector<int> a, cnt;
void rec(int x) {
    if (x==0) {
        int mn = INF;
        int mx = 0;
        for (int i=0; i<n; i++) {
            mn = min(mn, a[i]/cnt[i]);
            mx = max(mx, (a[i]+cnt[i]-1)/cnt[i]);
        }
        ans = min(ans, mx-mn);
        if (mx-mn==ans) {
            cur_mn = mn;
            cur_mx = mx;
        }
        return;
    }
    for (int i=0; i<n; i++) {
        cnt[i]++;
        rec(x-1);
        cnt[i]--;
    }
}
bool comp(array<int, 3> l, array<int, 3> r) {
    if (l[0]==r[0]) {
        return l[2]<r[2];
    } return l[0]>r[0];
}
void solve() {
    // cin >> n >> m;
    n = 6; m = 5;
    a.assign(n, 0);
    for (int i=0; i<n; i++) a[i] = random(1, 50);
    vector<int> ans1(m, 0), ans2, mn2(m), mx2(m), mn1(m), mx1(m);
    ans2 = ans1;
    {
        vector<int> cnt(n, 1);
        vector<array<int, 3>> maxs, mins;
        for (int i=0; i<n; i++) {
            for (int j=1; j<=m+1; j++) {
                maxs.push_back({(a[i]+j-1)/j, i, j});
                if (j!=1) mins.push_back({a[i]/j, i, j});
            }
        }
        sort(all(maxs), comp);
        sort(all(mins), comp);
        // for (int i=0; i<m; i++) {
        //     cout << maxs[i][0] << ' ' << maxs[i][1] << ' ' << maxs[i][2] << '\n';
        // }
        // cout << '\n';
        // for (int i=0; i<m; i++) {
        //     cout << mins[i][0] << ' ' << mins[i][1] << ' ' << mins[i][2] << '\n';
        // }
        for (int k=1; k<=m; k++) {
            vector<int> cnt(n, 1);
            int best = INF;
            int p_mn = *min_element(all(a));
            for (int i=0; i<=k; i++) {
                int left = k-i; 
                int j = 0;
                int mn = p_mn;
                while (left) {
                    if (mins[j][2]>cnt[mins[j][1]]) {
                        left--;
                    }
                    mn = min(mn, mins[j][0]);
                    j++;
                }
                best = min(best, maxs[i][0]-mn);
                cnt[maxs[i][1]]++;
                p_mn = min(p_mn, a[maxs[i][1]]/cnt[maxs[i][1]]);
            }
            ans1[k-1] = best;
        }
    }
    cnt.assign(n, 1);
    for (int k=1; k<=m; k++) {
        ans = INF;
        rec(k);
        ans2[k-1]=ans;
        mn2[k-1] = cur_mn;
        mx2[k-1] = cur_mx;
        // cout << ans << ' ';
    }
    if (ans1!=ans2) {
        cout << "BAD\n";
        for (auto i: a) cout << i << ' ';
        cout << '\n';
        for (auto i: ans1) cout << i << ' ';
        cout << '\n';
        for (auto i: ans2) cout << i << ' ';
        cout << '\n';
        for (int i=0; i<m; i++) {
            cout << mn1[i] << ' ' << mx1[i] << '\n';
        }
        cout << '\n';
        for (int i=0; i<m; i++) {
            cout << mn2[i] << ' ' << mx2[i] << '\n';
        }
        return;
    }
    
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    cout << setprecision(12);
    int tc = 500;
    // cin >>tc;
    while (tc--) solve();
}
Test details
Test 1
Group: 1, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1 1 6  | 
| correct output | 
|---|
| 0 | 
| user output | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
Test 7
Group: 3, 5, 6
Verdict: WRONG ANSWER
| 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: WRONG ANSWER
| 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 | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
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 | 
|---|
| (empty) | 
Test 13
Group: 4, 5, 6
Verdict: WRONG ANSWER
| 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 | 
|---|
| (empty) | 
Test 15
Group: 4, 5, 6
Verdict: WRONG ANSWER
| 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: WRONG ANSWER
| input | 
|---|
| 1000 2000 928772177 816188227 216592201 ...  | 
| correct output | 
|---|
| 991676844 990940224 990685481 ... | 
| user output | 
|---|
| (empty) | 
Test 17
Group: 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 2000 665759876 597950008 615453266 ...  | 
| correct output | 
|---|
| 498801198 498681904 498504321 ... | 
| user output | 
|---|
| (empty) | 
Test 18
Group: 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 500 2000 683288817 784230412 626685186 ...  | 
| correct output | 
|---|
| 497667621 498434895 495465990 ... | 
| user output | 
|---|
| (empty) | 
Test 19
Group: 5, 6
Verdict: WRONG ANSWER
| input | 
|---|
| 1000 2000 666667000 809309500 571572000 ...  | 
| correct output | 
|---|
| 499499500 499249250 498999000 ... | 
| user output | 
|---|
| (empty) | 
Test 20
Group: 6
Verdict: WRONG ANSWER
| input | 
|---|
| 100000 200000 861772559 734298084 983382252 ...  | 
| correct output | 
|---|
| 499973914 499985299 499985141 ... | 
| user output | 
|---|
| (empty) | 
Test 21
Group: 6
Verdict: WRONG ANSWER
| input | 
|---|
| 30000 200000 691834579 617419813 514778075 ...  | 
| correct output | 
|---|
| 499967533 499976270 499969810 ... | 
| user output | 
|---|
| (empty) | 
Test 22
Group: 6
Verdict: WRONG ANSWER
| input | 
|---|
| 100000 200000 820255000 960780000 741965000 ...  | 
| correct output | 
|---|
| 499995000 499992500 499990000 ... | 
| user output | 
|---|
| (empty) | 
