oj.uz

Submission #522275

# Submission time Handle Problem Language Result Execution time Memory
522275 2022-02-04T12:16:28 Z vonatlus Gift (IZhO18_nicegift) C++17
7 / 100
 279 ms 40408 KB 
/// adil sultanov | vonat1us 

#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")

#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
 
using namespace std;

using ll = long long;
using pii = pair<ll, int>;                                   

const int MOD = 1e9 + 7; 
const int INF = 1e9 + 1e2;
  
void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

const bool flag = 0;

const int N = 1e6+10;
 
pii t[N<<2];
 
ll a[N], n;
 
void build(int u = 0, int l = 0, int r = n) {
    if (r-l == 1) {
        t[u] = {a[l], l};
        return;
    }
    int m = l+r >> 1;
    build(u+u+1, l, m);
    build(u+u+2, m, r);
    t[u] = max(t[u+u+1], t[u+u+2]);
}
 
void modify(int pos, ll val, int u = 0, int l = 0, int r = n) {
    if (r-l == 1) {
        t[u].x = val;
        return;
    }
    int m = l+r >> 1;
    if (pos < m) {
        modify(pos, val, u+u+1, l, m);
    } else {
        modify(pos, val, u+u+2, m, r);
    }
    t[u] = max(t[u+u+1], t[u+u+2]);
}
 
void ma1n() {
    ll k;
    cin >> n >> k;
    ll sum = 0;
    for (int i = 0; i < n; ++i) {
        cin >> a[i], sum += a[i];
    }        
    if (sum%k) {
        cout << -1, exit(0);
    }
    if (*min_element(a, a+n) == *max_element(a, a+n)) {
        if (n%k == 0) {
            cout << n/k << "\n";
            for (int i = 0; i < n; i += k) {
                cout << a[i] << " ";
                for (int j = i; j < i+k; ++j) cout << j+1 << " ";
                cout << "\n";
            }
            return;            
        } 
        if (a[0]%__gcd(n, k) != 0) {
            cout << -1, exit(0);
        }
        vector<vector<int>> ans;
        int st = 0;
        do {
            vector<int> p;
            for (int i = st; i < st+k; ++i) {
                p.pb(i%n);
            }
            ans.pb(p);
            st = (st+k)%n;
        } while (st != 0);
        cout << sz(ans) << "\n";
        for (auto v : ans) {
            cout << a[0]/__gcd(n, k) << " ";
            for (int x : v) cout << x+1 << " ";
            cout << "\n";
        }
        return;    
    } 
    vector<int> ans;
    build();
    while (1) {
        if (t[0].x == 0) break;
        vector<pii> v;
        for (int i = 0; i < k; ++i) {
            if (t[0].x == 0) {
                cout << "NO", exit(0);
                cout << -1, exit(0);
            }
            v.pb({t[0].y, t[0].x});
            modify(t[0].y, 0);
        }                   
        ll d = v.back().y-(t[0].x ? t[0].x : 1)+1;
        ans.pb(d);
        for (pii& x : v) {
            ans.pb(x.x+1);
            modify(x.x, x.y-d);
        }
    }
    cout << sz(ans)/(k+1) << "\n";
    for (int i = 0; i < sz(ans); i += k+1) {
        for (int j = i; j <= i+k; ++j) {
            cout << ans[j] << " ";
        }
        cout << "\n";
    }
} 

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int ts = 1;
    if (flag) {
        cin >> ts;
    }
    while (ts--) {
        ma1n(); 
    }
    return 0;
}

Compilation message

nicegift.cpp: In function 'void build(int, int, int)':
nicegift.cpp:41:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |     int m = l+r >> 1;
      |             ~^~
nicegift.cpp: In function 'void modify(int, ll, int, int, int)':
nicegift.cpp:52:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |     int m = l+r >> 1;
      |             ~^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB n=4
2 Correct 1 ms 324 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 1 ms 328 KB n=2

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB n=4
2 Correct 1 ms 324 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 1 ms 328 KB n=2
7 Correct 0 ms 320 KB n=5
8 Incorrect 1 ms 332 KB Expected integer, but "NO" found
9 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB n=4
2 Correct 1 ms 324 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 1 ms 328 KB n=2
7 Correct 0 ms 320 KB n=5
8 Incorrect 1 ms 332 KB Expected integer, but "NO" found
9 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 269 ms 22680 KB n=1000000
2 Correct 165 ms 13384 KB n=666666
3 Correct 95 ms 7600 KB n=400000
4 Incorrect 279 ms 40408 KB Taken too much stones from the heap
5 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB n=4
2 Correct 1 ms 324 KB n=3
3 Correct 1 ms 204 KB n=3
4 Correct 0 ms 204 KB n=4
5 Correct 0 ms 204 KB n=4
6 Correct 1 ms 328 KB n=2
7 Correct 0 ms 320 KB n=5
8 Incorrect 1 ms 332 KB Expected integer, but "NO" found
9 Halted 0 ms 0 KB -