oj.uz

답안 #571312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571312 2022-06-01T17:16:09 Z Sam_a17 Gift (IZhO18_nicegift) C++14
30 / 100
 894 ms 44072 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve_() {
  int n, k;
  cin >> n >> k;

  vector<pair<long long, long long>> a(n);

  bool flag = true;
  for (int i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;

    if (i && a[i].first != a[0].first) {
      flag = false;
    }
  }

  if (flag) {
    if (n % k != 0) {
      printf("-1\n");
      return;
    }

    cout << n / k << endl;
    for (int i = k - 1; i < n; i += k) {
      cout << a[0].first << " ";
      for (int j = i - k; j < i; j++) {
        cout << j + 2 << " ";
      }
      cout << endl;
    }

    return;
  }

  sort(all(a));
  if (n == 1) {
    printf("-1\n");
    return;
  }

  priority_queue<pair<long long, long long>> q;
  for (int i = 0; i < n; i++) {
    q.push({a[i]});
  }
  vector<pair<vector<long long>, long long>> answ;
  while (sz(q) >= k) {
    vector<pair<long long, long long>> curr;
    vector<long long> to_answ;

    int cnt = 1;
    while(!q.empty() && cnt <= k) {
      curr.push_back(q.top());
      to_answ.push_back(q.top().second);
      q.pop();
      cnt++;
    }

    if(cnt != k + 1) {
      printf("-1\n");
      return;
    }

    long long mini;
    if(!q.empty()) {
      mini = curr.back().first - q.top().first + 1;
    } else {
      mini = curr.back().first;
    }

    answ.push_back({to_answ, mini});

    for(auto &i: curr) {
      i.first -= mini;

      if(i.first) {
        q.push(i);
      }
    }
  }

  if (!q.empty()) {
    printf("-1\n");
    return;
  } else {
    printf("%d\n", sz(answ));
    for (auto u: answ) {
      printf("%lld ", u.second);
      for(auto i: u.first) {
        printf("%lld ", i + 1);
      }
      printf("\n");
    }
    return;
  }

}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

nicegift.cpp: In function 'void setIO(std::string)':
nicegift.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nicegift.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n=4
2 Correct 1 ms 212 KB n=3
3 Correct 1 ms 212 KB n=3
4 Correct 1 ms 212 KB n=4
5 Correct 1 ms 212 KB n=4
6 Correct 1 ms 212 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n=4
2 Correct 1 ms 212 KB n=3
3 Correct 1 ms 212 KB n=3
4 Correct 1 ms 212 KB n=4
5 Correct 1 ms 212 KB n=4
6 Correct 1 ms 212 KB n=2
7 Correct 1 ms 316 KB n=5
8 Correct 1 ms 340 KB n=8
9 Correct 5 ms 1108 KB n=14
10 Correct 4 ms 852 KB n=11
11 Correct 32 ms 4428 KB n=50000
12 Correct 38 ms 5136 KB n=50000
13 Correct 15 ms 2096 KB n=10
14 Correct 28 ms 3424 KB n=685
15 Correct 30 ms 3712 KB n=623
16 Correct 17 ms 2232 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n=4
2 Correct 1 ms 212 KB n=3
3 Correct 1 ms 212 KB n=3
4 Correct 1 ms 212 KB n=4
5 Correct 1 ms 212 KB n=4
6 Correct 1 ms 212 KB n=2
7 Correct 1 ms 316 KB n=5
8 Correct 1 ms 340 KB n=8
9 Correct 5 ms 1108 KB n=14
10 Correct 4 ms 852 KB n=11
11 Correct 32 ms 4428 KB n=50000
12 Correct 38 ms 5136 KB n=50000
13 Correct 15 ms 2096 KB n=10
14 Correct 28 ms 3424 KB n=685
15 Correct 30 ms 3712 KB n=623
16 Correct 17 ms 2232 KB n=973
17 Correct 32 ms 2732 KB n=989
18 Correct 14 ms 1232 KB n=563
19 Correct 21 ms 1528 KB n=592
20 Correct 20 ms 1616 KB n=938
21 Correct 15 ms 1468 KB n=747
22 Correct 19 ms 1464 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 894 ms 44072 KB n=1000000
2 Correct 441 ms 27756 KB n=666666
3 Correct 238 ms 15852 KB n=400000
4 Incorrect 44 ms 8620 KB Jury has the answer but participant has not
5 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n=4
2 Correct 1 ms 212 KB n=3
3 Correct 1 ms 212 KB n=3
4 Correct 1 ms 212 KB n=4
5 Correct 1 ms 212 KB n=4
6 Correct 1 ms 212 KB n=2
7 Correct 1 ms 316 KB n=5
8 Correct 1 ms 340 KB n=8
9 Correct 5 ms 1108 KB n=14
10 Correct 4 ms 852 KB n=11
11 Correct 32 ms 4428 KB n=50000
12 Correct 38 ms 5136 KB n=50000
13 Correct 15 ms 2096 KB n=10
14 Correct 28 ms 3424 KB n=685
15 Correct 30 ms 3712 KB n=623
16 Correct 17 ms 2232 KB n=973
17 Correct 32 ms 2732 KB n=989
18 Correct 14 ms 1232 KB n=563
19 Correct 21 ms 1528 KB n=592
20 Correct 20 ms 1616 KB n=938
21 Correct 15 ms 1468 KB n=747
22 Correct 19 ms 1464 KB n=991
23 Correct 894 ms 44072 KB n=1000000
24 Correct 441 ms 27756 KB n=666666
25 Correct 238 ms 15852 KB n=400000
26 Incorrect 44 ms 8620 KB Jury has the answer but participant has not
27 Halted 0 ms 0 KB -