oj.uz

답안 #1090350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090350 2024-09-18T09:22:53 Z TrinhKhanhDung Teams (CEOI11_tea) C++14
0 / 100
 231 ms 51904 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 1e6 + 10;

int N;
pair<int, int> a[MAX];
vector<int> res[MAX];
int ans[MAX];

void solve(){
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> a[i].fi;
        a[i].se = i;
    }
    sort(a + 1, a + N + 1);
    int cur = 0;
    int i = N, l = INF, r = N;
    while(i > 0){
        if(a[i].fi > i) break;
        cur++;
        minimize(l, a[i].fi);
        i -= a[i].fi;
    }

    if(cur == 1){
        cout << 1 << '\n' << N << ' ';
        for(int i = 1; i <= N; i++) cout << i << ' ';
        return;
    }

    auto OK = [&](int k) -> bool{
        for(int i = N; i >= 1; i -= k){
            if(a[i].fi > i || a[i].fi > k) return false;
        }
        return true;
    };

    l = (N - 1) / cur + 1, r = (N - 1) / (cur - 1);

    while(l < r){
        int m = (l + r) >> 1;
        if(OK(m)){
            r = m;
        }
        else{
            l = m + 1;
        }
    }
    int d = 0;
    for(int i = N; i >= 1; i -= r){
        d++;
        for(int j = 0; j < r; j++) ans[a[i - j].se] = d;
    }
    for(int i = 1; i <= N % r; i++) ans[a[i].se] = cur;

    for(int i = 1; i <= N; i++) res[ans[i]].push_back(i);
    cout << cur << '\n';
    for(int i = 1; i <= cur; i++){
        cout << sz(res[i]) << ' ';
        for(int j: res[i]) cout << j << ' ';
        cout << '\n';
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("capsomayman.inp","r",stdin);
//     freopen("capsomayman.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

//5
//2
//1
//2
//2
//3

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23900 KB Output is correct
2 Incorrect 12 ms 23896 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 23900 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 23900 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 23896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 26180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 26456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 148 ms 44880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 198 ms 51228 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 231 ms 51904 KB Output isn't correct
2 Halted 0 ms 0 KB -