oj.uz

답안 #502627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502627 2022-01-06T11:02:20 Z lukameladze Gift (IZhO18_nicegift) C++14
30 / 100
 2000 ms 229340 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pb push_back
#define pii pair <int, int>
using namespace std;
const int N = 3e6 + 5;
int n,k,a[N],mx,cur,sum,le,ri,mid,sum1,mx1,mn,anss,cnt;
vector < pii > v;
vector <int> ans[N];
vector < pii > v1;
int pas[N];
set <pii > :: iterator it;
set < pii > ms;
main() {
  	std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>k;
    for (int i = 1; i <= n; i++) {
        cin>>a[i];
        mx = max(mx,a[i]);
        sum += a[i];
        ms.insert({a[i],i});
    }
    if (mx > sum / k || sum % k) {
        cout<<"-1"<<endl;
        return 0;
    }
    int ss = 0;
    sum1 = sum;
    while (true) {
        v.clear();v1.clear();
        mx = mx1 = 0;
        if (ms.size() == 0) break;
        mn = 1e9;
    	   it = ms.end();
    	   cnt = 0;
        while (true) {
            it--;
            cnt++;
            if (cnt <= k) {
                mx = max(mx,(*it).f);
                mn = min(mn,(*it).f);
            }
            if (cnt == k + 1) {
                mx1 = (*it).f;
                break;
            }
            if (it == ms.begin()) break;
        }
        le = 1;
        ri = 1e5;
        while(le <= ri) {
            mid = (le + ri) / 2;
            if (mn < mid || max(mx1,mx-mid)>(sum1 - k*mid)/k) {
                ri = mid - 1;
            } else {
                anss = mid;
                le = mid + 1;
            }
        }
        cur++;
        pas[cur] = anss;
        for (int i = 0; i < k; i++) {
        	it = ms.end();
            it--;
            int x = (*it).f; int y = (*it).s;
            a[y] -= anss;sum1 -= anss;
            v1.pb({x - anss, y});
            ans[cur].pb(y);
			ms.erase(it);
        }
        for (int i = 0; i < v1.size(); i++) {
        	if (v1[i].f != 0)
            ms.insert({v1[i].f,v1[i].s});
        }
    }
    cout<<cur<<"\n";
    for (int i = 1; i <= cur; i++) {
        cout<<pas[i]<<" ";
        for (int j = 0; j < ans[i].size(); j++) {
            cout<<ans[i][j]<<" ";
        }cout<<"\n";
    }
}

Compilation message

nicegift.cpp:16:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   16 | main() {
      | ^~~~
nicegift.cpp: In function 'int main()':
nicegift.cpp:73:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for (int i = 0; i < v1.size(); i++) {
      |                         ~~^~~~~~~~~~~
nicegift.cpp:81:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for (int j = 0; j < ans[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~
nicegift.cpp:29:9: warning: unused variable 'ss' [-Wunused-variable]
   29 |     int ss = 0;
      |         ^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70732 KB n=4
2 Correct 34 ms 70684 KB n=3
3 Correct 33 ms 70724 KB n=3
4 Correct 33 ms 70736 KB n=4
5 Correct 37 ms 70732 KB n=4
6 Correct 33 ms 70744 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70732 KB n=4
2 Correct 34 ms 70684 KB n=3
3 Correct 33 ms 70724 KB n=3
4 Correct 33 ms 70736 KB n=4
5 Correct 37 ms 70732 KB n=4
6 Correct 33 ms 70744 KB n=2
7 Correct 34 ms 70644 KB n=5
8 Correct 33 ms 70680 KB n=8
9 Correct 36 ms 70856 KB n=14
10 Correct 37 ms 70844 KB n=11
11 Correct 58 ms 74896 KB n=50000
12 Correct 54 ms 74784 KB n=50000
13 Correct 32 ms 70732 KB n=10
14 Correct 33 ms 70796 KB n=685
15 Correct 34 ms 70768 KB n=623
16 Correct 35 ms 70840 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70732 KB n=4
2 Correct 34 ms 70684 KB n=3
3 Correct 33 ms 70724 KB n=3
4 Correct 33 ms 70736 KB n=4
5 Correct 37 ms 70732 KB n=4
6 Correct 33 ms 70744 KB n=2
7 Correct 34 ms 70644 KB n=5
8 Correct 33 ms 70680 KB n=8
9 Correct 36 ms 70856 KB n=14
10 Correct 37 ms 70844 KB n=11
11 Correct 58 ms 74896 KB n=50000
12 Correct 54 ms 74784 KB n=50000
13 Correct 32 ms 70732 KB n=10
14 Correct 33 ms 70796 KB n=685
15 Correct 34 ms 70768 KB n=623
16 Correct 35 ms 70840 KB n=973
17 Correct 33 ms 70804 KB n=989
18 Correct 40 ms 70852 KB n=563
19 Correct 34 ms 70732 KB n=592
20 Correct 35 ms 70780 KB n=938
21 Correct 34 ms 70732 KB n=747
22 Correct 35 ms 70776 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2012 ms 229340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70732 KB n=4
2 Correct 34 ms 70684 KB n=3
3 Correct 33 ms 70724 KB n=3
4 Correct 33 ms 70736 KB n=4
5 Correct 37 ms 70732 KB n=4
6 Correct 33 ms 70744 KB n=2
7 Correct 34 ms 70644 KB n=5
8 Correct 33 ms 70680 KB n=8
9 Correct 36 ms 70856 KB n=14
10 Correct 37 ms 70844 KB n=11
11 Correct 58 ms 74896 KB n=50000
12 Correct 54 ms 74784 KB n=50000
13 Correct 32 ms 70732 KB n=10
14 Correct 33 ms 70796 KB n=685
15 Correct 34 ms 70768 KB n=623
16 Correct 35 ms 70840 KB n=973
17 Correct 33 ms 70804 KB n=989
18 Correct 40 ms 70852 KB n=563
19 Correct 34 ms 70732 KB n=592
20 Correct 35 ms 70780 KB n=938
21 Correct 34 ms 70732 KB n=747
22 Correct 35 ms 70776 KB n=991
23 Execution timed out 2012 ms 229340 KB Time limit exceeded
24 Halted 0 ms 0 KB -