oj.uz

Submission #40568

# Submission time Handle Problem Language Result Execution time Memory
40568 2018-02-05T02:13:48 Z Just_Solve_The_Problem Gift (IZhO18_nicegift) C++11
26 / 100
 462 ms 77216 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define pii pair < ll, ll >
#define fr first
#define sc second
#define mk make_pair

const int N = (int)1e6 + 7;

ll sum = 0;
ll a[N];
vector < vector < pii > > block;
vector < vector < ll > > ans;
vector < ll > ans1;
int pointer[N];

main() {
  int n, k; scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    sum += a[i];
  }
  if (sum % k != 0) {
    puts("-1");
    return 0;
  }
  sum /= k;
  vector < pii > vec;
  vector < ll > v;
  int in = 1;
  ll res = 0;
  while (in <= n) {
    if (res + a[in] > sum) {
      vec.pb(mk(a[in] - (res + a[in] - sum), in));
      a[in] = res + a[in] - sum;
      res = sum;
    } else {
      vec.pb(mk(a[in], in));
      res += a[in];
      in++;
    }
    if (res == sum) {
      res = 0;
      pointer[block.size()] = vec.size() - 1;
      block.pb(vec);
      vec.clear();
    }
  }
  sum *= k;
  while (sum > 0) {
    ll mn = 2e18;
    for (int i = 0; i < k; i++) {
      mn = min(mn, block[i][pointer[i]].fr);
      v.pb(block[i][pointer[i]].sc);
    }
    sum -= k * mn;
    for (int i = 0; i < k; i++) {
      block[i][pointer[i]].fr -= mn;
      if (block[i][pointer[i]].fr == 0) {
        pointer[i]--;
      }
    }
    ans.pb(v);
    v.clear();
    ans1.pb(mn);
  }
  printf("%d\n", ans.size());
  for (int i = 0; i < ans.size(); i++) {
    printf("%lld ", ans1[i]);
    for (int j = 0; j < ans[i].size(); j++) {
      printf("%lld ", ans[i][j]);
    }
    printf("\n");
  }
}

Compilation message

nicegift.cpp:21:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
nicegift.cpp: In function 'int main()':
nicegift.cpp:71:28: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::vector<long long int> >::size_type {aka long unsigned int}' [-Wformat=]
   printf("%d\n", ans.size());
                            ^
nicegift.cpp:72:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < ans.size(); i++) {
                     ^
nicegift.cpp:74:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < ans[i].size(); j++) {
                       ^
nicegift.cpp:22:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int n, k; scanf("%d %d", &n, &k);
                                   ^
nicegift.cpp:24:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &a[i]);
                         ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 1 ms 352 KB n=3
3 Correct 1 ms 404 KB n=3
4 Correct 1 ms 404 KB n=4
5 Correct 2 ms 404 KB n=4
6 Correct 1 ms 404 KB n=2

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 1 ms 352 KB n=3
3 Correct 1 ms 404 KB n=3
4 Correct 1 ms 404 KB n=4
5 Correct 2 ms 404 KB n=4
6 Correct 1 ms 404 KB n=2
7 Correct 2 ms 404 KB n=5
8 Incorrect 2 ms 464 KB Same heap occurs twice
9 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 1 ms 352 KB n=3
3 Correct 1 ms 404 KB n=3
4 Correct 1 ms 404 KB n=4
5 Correct 2 ms 404 KB n=4
6 Correct 1 ms 404 KB n=2
7 Correct 2 ms 404 KB n=5
8 Incorrect 2 ms 464 KB Same heap occurs twice
9 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 77216 KB n=1000000
2 Correct 285 ms 77216 KB n=666666
3 Correct 144 ms 77216 KB n=400000
4 Correct 423 ms 77216 KB n=285714
5 Correct 18 ms 77216 KB n=20000
6 Correct 336 ms 77216 KB n=181818
7 Correct 12 ms 77216 KB n=10000
8 Correct 40 ms 77216 KB n=6666
9 Correct 3 ms 77216 KB n=4000
10 Correct 228 ms 77216 KB n=2857
11 Correct 4 ms 77216 KB n=2000

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB n=4
2 Correct 1 ms 352 KB n=3
3 Correct 1 ms 404 KB n=3
4 Correct 1 ms 404 KB n=4
5 Correct 2 ms 404 KB n=4
6 Correct 1 ms 404 KB n=2
7 Correct 2 ms 404 KB n=5
8 Incorrect 2 ms 464 KB Same heap occurs twice
9 Halted 0 ms 0 KB -